CoRR, October 2003

• Edu Metz, Raimondas Lencevicius:
  A Performance Analysis Tool for Nokia Mobile Phone Software.
  
• Suresh Venkatasubramanian:
  The Graphics Card as a Streaming Computer.
  
• Darin Goldstein, Nick Meyer:
  The Wake Up and Report Problem is Time-Equivalent to the Firing Squad Synchronization Problem.
  
• Darin Goldstein:
  Determination of the Topology of a Directed Network.
  
• Darin Goldstein, William Murray, Binh Yang:
  Using Artificial Intelligence for Model Selection.
  
• Serge Abiteboul, Rakesh Agrawal, Philip A. Bernstein, Michael J. Carey, Stefano Ceri, W. Bruce Croft, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Dieter Gawlick, Jim Gray, Laura M. Haas, Alon Y. Halevy, Joseph M. Hellerstein, Yannis E. Ioannidis, Martin L. Kersten, Michael J. Pazzani, Michael Lesk, David Maier, Jeffrey F. Naughton, Hans-Jörg Schek, Timos K. Sellis, Avi Silberschatz, Michael Stonebraker, Richard T. Snodgrass, Jeffrey D. Ullman, Gerhard Weikum, Jennifer Widom, Stanley B. Zdonik:
  The Lowell Database Research Self Assessment.
  
• Christian Schaubschläger, Dieter Kranzlmüller, Jens Volkert:
  Event-based Program Analysis with DeWiz.
  
• Gianluca Argentini:
  Poster on MPI application in Computational Fluid Dynamics.
  
• Artur Rataj:
  On Interference of Signals and Generalization in Feedforward Neural Networks.
  
• David Lyback:
  Transient Diversity in Multi-Agent Systems.
  
• Robert Capra, Manuel A. Pérez-Quiñones:
  Re-Finding Found Things: An Exploratory Study of How Users Re-Find Information.
  
• Georg Gottlob, Christoph Koch:
  A Formal Comparison of Visual Web Wrapper Generators.
  
• Franco Bagnoli, Fabio Franci, Francesco Mugelli, Andrea Sterbini:
  WebTeach in practice: the entrance test to the Engineering faculty in Florence.
  
• Rodney J. Clarke, Philip C. Windridge, Dali Dong:
  Effective XML Representation for Spoken Language in Organisations.
  
• Masao Okita, Fumihiko Ino, Kenichi Hagihara:
  Debugging Tool for Localizing Faulty Processes in Message Passing Programs.
  
• Bil Lewis:
  Debugging Backwards in Time.
  
• Chris Doran:
  Circle and sphere blending with conformal geometric algebra.
  
• Jiyou Jia:
  The Study of the Application of a Keywords-based Chatbot System on the Teaching of Foreign Languages.
  
• Michel Koskas:
  A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs.
  
• Marija Kulas:
  Pure Prolog Execution in 21 Rules.
  
• Ladislav J. Kohout, Eunjin Kim, Gary Zenz:
  Fuzzy Relational Modeling of Cost and Affordability for Advanced Technology Manufacturing Environment.
  
• Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng:
  Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices.
  
• Igor Bocharov, Pavel Lukin:
  Application of Kullback-Leibler Metric to Speech Recognition.
  
• Joel Huselius, Henrik Thane, Daniel Sundmark:
  Availability Guarantee for Deterministic Replay Starting Points in Real-Time Systems.
  
• Mikhail Auguston, Clinton Jeffery, Scott Underwood:
  A Monitoring Language for Run Time and Post-Mortem Behavior Analysis and Visualization.
  
• Akira Sasaki, Masataka Sassa:
  Generalized Systematic Debugging for Attribute Grammars.
  
• Sándor P. Fekete, Joseph S. B. Mitchell, Karin Beurer:
  On the continuous Fermat-Weber problem.
  
• Anoop Jain, Parag Sarda, Jayant R. Haritsa:
  Providing Diversity in K-Nearest Neighbor Query Results.
  
• Rajeev Thakur, William Gropp, Ewing L. Lusk:
  Optimizing Noncontiguous Accesses in MPI-IO.
  
• Oliver Oppitz:
  A Particular Bug Trap: Execution Replay Using Virtual Machines.
  
• Vin de Silva:
  A weak definition of Delaunay triangulation.
  
• Sándor P. Fekete, Jörg Schepers:
  A combinatorial characterization of higher-dimensional orthogonal packing.
  
• Turker Ozsari:
  A Hash of Hash Functions.
  
• Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer:
  Minimizing the stabbing number of matchings, trees, and triangulations.
  
• Abhijit Kadlag, Amol V. Wanjari, Juliana Freire, Jayant R. Haritsa:
  Supporting Exploratory Queries in Database Centric Web Applications.
  
• Daniel A. Spielman, Shang-Hua Teng:
  Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m^1.31).
  
• Sándor P. Fekete, Henk Meijer:
  Maximum dispersion and geometric maximum weight cliques.
  
• Shipra Agrawal, Vijay Krishnan, Jayant R. Haritsa:
  On Addressing Efficiency Concerns in Privacy Preserving Data Mining.
  
• Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
  A Game Theoretic Framework for Incentives in P2P Systems.
  
• Brock Pytlik, Manos Renieris, Shriram Krishnamurthi, Steven P. Reiss:
  Automated Fault Localization Using Potential Invariants.
  
• Pavlina Fragkou:
  A Dynamic Programming Algorithm for the Segmentation of Greek Texts.
  
• Mireille Ducassé, Ludovic Langevine, Pierre Deransart:
  Rigorous design of tracers: an experiment for constraint logic programming.
  
• Jules Sadefo Kamdem:
  Value-at-Risk and Expected Shortfall for Quadratic portfolio of securities with mixture of elliptic Distributed Risk Factors.
  
• Ali E. Abbas:
  The Algebra of Utility Inference.
  
• Ali E. Abbas:
  An information theory for preferences.
  
• Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin:
  Theory of One Tape Linear Time Turing Machines.
  
• Simona Perri, Francesco Scarcello, Nicola Leone:
  Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation.
  
• Sébastien Gaspard, Florida Estrella, Richard McClatchey, Régis Dindeleux:
  Managing Evolving Business Workflows through the Capture of Descriptive Information.
  
• Vladimir Batagelj, Matjaz Zaversnik:
  An O(m) Algorithm for Cores Decomposition of Networks.
  
• Artur Rataj:
  Fast Feedforward Neural Networks with Diffused Nonlinear Weight Functions.
  
• Daniel A. Spielman, Shang-Hua Teng:
  Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems.
  
• Kamil Kulesza, Zbigniew Kotulski:
  On secret sharing for graphs.
  
• Kamil Kulesza, Zbigniew Kotulski:
  Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography.
  
• Jules Desharnais, Bernhard Möller, Georg Struth:
  Kleene algebra with domain.
  
• William McCune:
  Mace4 Reference Manual and Guide.
  
• William McCune:
  OTTER 3.3 Reference Manual.
  
• Uwe Naumann, Andrea Walther:
  An Introduction to Using Software Tools for Automatic Differentiation.
  
• Rodney J. Clarke, Dali Dong, Philip C. Windridge:
  Application Architecture for Spoken Language Resources in Organisational Settings.
  
• Jiuxing Liu, Weihang Jiang, Pete Wyckoff, Dhabaleswar K. Panda, David Ashton, Darius Buntinas, William Gropp, Brian R. Toonen:
  Design and Implementation of MPICH2 over InfiniBand with RDMA Support.
  
• Craig Alan Feinstein:
  Evidence that P is not equal to NP.
  
• Lengning Liu, Miroslaw Truszczynski:
  Local-search techniques for propositional logic extended with cardinality constraints.
  
• Lengning Liu, Miroslaw Truszczynski:
  WSAT(cc) - a fast local-search ASP solver.
  
• V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski:
  Logic programs with monotone cardinality atoms.
  
• Michael R. Dransfield, V. Wiktor Marek, Miroslaw Truszczynski:
  Satisfiability and computing van der Waerden numbers.
  
• Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
  Maintaining Information in Fully-Dynamic Trees with Top Trees.
  
• Dimitris Achlioptas, Cristopher Moore:
  Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold.
  
• Bernd Fiedler:
  Generators of algebraic covariant derivative curvature tensors and Young symmetrizers.
  
• Dan Romik:
  Shortest paths in the Tower of Hanoi graph and finite automata.
  
• Lucian Ilie, Jeffrey Shallit:
  A Generalization of Repetition Threshold.
  
• Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari:
  Sharp thresholds for monotone properties in random geometric graphs.
  
• Jörn Anemüller, Terrence J. Sejnowski, Scott Makeig:
  Complex Independent Component Analysis of Frequency-Domain Electroencephalographic Data.
  
• Lev Koyrakh:
  Pattern Excitation-Based Processing: The Music of The Brain.
  
• Fang Wu, Bernardo A. Huberman:
  Finding Communities in Linear Time: A Physics Approach.
  

Last update Sat May 18 20:13:05 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page