CoRR, January 2003

• Nikolai Chernov, Claire Lesort:
  Least squares fitting of circles and lines.
  
• Cass W. Everitt, Mark J. Kilgard:
  Practical and Robust Stenciled Shadow Volumes for Hardware-Accelerated Rendering.
  
• Alexandros Eleftheriadis, Danny Hong:
  Flavor: A Language for Media Representation.
  
• Vince Grolmusz:
  Near Quadratic Matrix Multiplication Modulo Composites.
  
• R. Ganesh, B. Kaushik, R. Sadhu:
  Modelling Delay Jitter in Voice over IP.
  
• Bálint Takács, Istvan Szita, András Lörincz:
  Temporal plannability by variance of the episode length.
  
• Istvan Szita, András Lörincz:
  Kalman filter control in the reinforcement learning framework.
  
• Pascal Hitzler, Matthias Wendt:
  Formal Concept Analysis and Resolution in Algebraic Domains.
  
• Qingguo Zheng:
  A Script Language for Data Integration in Database.
  
• Kewen Wang, Lizhu Zhou:
  Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs.
  
• Michael J. O'Donnell:
  Open Network Handles Implemented in DNS.
  
• Sergey I. Nikolenko:
  Hard satisfiable formulas for DPLL-type algorithms.
  
• Steven M. Kautz:
  Independence Properties of Algorithmically Random Sequences.
  
• Marcus Hutter:
  Convergence and Loss Bounds for Bayesian Sequence Prediction.
  
• Giorgio Parisi:
  Some remarks on the survey decimation algorithm for K-satisfiability.
  
• Peter Bürgisser, Martin Lotz:
  Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps.
  
• Millist W. Vincent, Jixue Liu:
  Completeness and Decidability Properties for Functional Dependencies in XML.
  
• Srinidhi Varadarajan, Naren Ramakrishnan:
  Novel Runtime Systems Support for Adaptive Compositional Modeling on the Grid.
  
• Daniel A. Spielman, Shang-Hua Teng:
  Smoothed Analysis of Interior-Point Algorithms: Termination.
  
• Pierre Dusart, Gilles Letourneux, Olivier Vivolo:
  Differential Fault Analysis on A.E.S.
  
• Lauro Lins, Sóstenes Lins, Silvio Melo:
  PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays.
  
• Dima Grigoriev, Ilia V. Ponomarenko:
  Homomorphic public-key cryptosystems and encrypting boolean circuits.
  
• Torsten Schaub, Kewen Wang:
  A semantic framework for preference handling in answer set programming.
  
• Jean-Luc Brylinski, Ranee Brylinski:
  Complexity and Completeness of Immanants.
  
• Lauro Lins, Sóstenes Lins, Silvio Melo:
  PHORMA: Perfectly Hashed Order Restricted Multidimensional Array.
  
• Michael Beeson, Robert Veroff, Larry Wos:
  Double-Negation Elimination in Some Propositional Logics.
  
• Thomas Wolf:
  A comparison of four approaches to the calculation of conservation laws.
  
• Thomas Wolf:
  The integration of systems of linear PDEs using conservation laws of syzygies.
  
• Thomas Wolf:
  Size reduction and partial decoupling of systems of equations.
  
• Ronald I. Greenberg:
  Bounds on the Number of Longest Common Subsequences.
  
• Katarzyna Keahey, Von Welch:
  Fine-Grain Authorization for Resource Management in the Grid Environment.
  
• Oleg Kiselyov:
  Subclassing errors, OOP, and practically checkable rules to prevent them.
  
• Katarzyna Keahey, T. W. Fredian, Qian Peng, David P. Schissel, Mary R. Thompson, Ian T. Foster, M. J. Greenwald, Douglas McCune:
  Computational Grids in Action: The National Fusion Collaboratory.
  
• Ronald I. Greenberg:
  Computing the Number of Longest Common Subsequences.
  
• Alex Brodsky, Jan Bækgaard Pedersen, Alan S. Wagner:
  On the Complexity of Buffer Allocation in Message Passing Systems.
  
• Joe Francoeur:
  Algorithms using Java for Spreadsheet Dependent Cell Recomputation.
  
• David Aldous, Allon G. Percus:
  Scaling and Universality in Continuous Length Combinatorial Optimization.
  
• Wolfgang Barthel, Alexander K. Hartmann, Martin Weigt:
  Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms.
  
• Guilhem Semerjian, Rémi Monasson:
  Relaxation and Metastability in the RandomWalkSAT search procedure.
  
• Constantino Tsallis, Celia Anteneodo, Lisa Borland, Roberto Osorio:
  Nonextensive statistical mechanics and economics.
  
• Kagan Tumer, David Wolpert:
  Collectives for the Optimal Combination of Imperfect Objects.
  
• Bernd Fiedler:
  On the symmetry classes of the first covariant derivatives of tensor fields.
  
• N. Raghavendra:
  Binary trees and fibred categories.
  
• David Wolpert, Kagan Tumer, Esfandiar Bandari:
  Improving Search Algorithms by Using Intelligent Coordinates.
  
• Toby Ord, Tien D. Kieu:
  On the existence of a new family of Diophantine equations for Omega.
  
• Charles Ofria, Christoph Adami, Travis C. Collier:
  Selective pressures on genomes in molecular evolution.
  

Last update Mon May 20 00:06:34 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page