CoRR, January 2003

• Nikolai Chernov, Claire Lesort:
  Least squares fitting of circles and lines. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CV/0301001]
• Cass W. Everitt, Mark J. Kilgard:
  Practical and Robust Stenciled Shadow Volumes for Hardware-Accelerated Rendering. , (informal publication)
  Electronic Edition (link) BibTeX [cs.GR/0301002]
• Alexandros Eleftheriadis, Danny Hong:
  Flavor: A Language for Media Representation. , (informal publication)
  Electronic Edition (link) BibTeX [cs.PL/0301003]
• Vince Grolmusz:
  Near Quadratic Matrix Multiplication Modulo Composites. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0301004]
• R. Ganesh, B. Kaushik, R. Sadhu:
  Modelling Delay Jitter in Voice over IP. , (informal publication)
  Electronic Edition (link) BibTeX [cs.PF/0301005]
• Bálint Takács, Istvan Szita, András Lörincz:
  Temporal plannability by variance of the episode length. , (informal publication)
  Electronic Edition (link) BibTeX [cs.AI/0301006]
• Istvan Szita, András Lörincz:
  Kalman filter control in the reinforcement learning framework. , (informal publication)
  Electronic Edition (link) BibTeX [cs.LG/0301007]
• Pascal Hitzler, Matthias Wendt:
  Formal Concept Analysis and Resolution in Algebraic Domains. , (informal publication)
  Electronic Edition (link) BibTeX [cs.LO/0301008]
• Qingguo Zheng:
  A Script Language for Data Integration in Database. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DB/0301009]
• Kewen Wang, Lizhu Zhou:
  Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs. , (informal publication)
  Electronic Edition (link) BibTeX [cs.AI/0301010]
• Michael J. O'Donnell:
  Open Network Handles Implemented in DNS. , (informal publication)
  Electronic Edition (link) BibTeX [cs.NI/0301011]
• Sergey I. Nikolenko:
  Hard satisfiable formulas for DPLL-type algorithms. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0301012]
• Steven M. Kautz:
  Independence Properties of Algorithmically Random Sequences. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0301013]
• Marcus Hutter:
  Convergence and Loss Bounds for Bayesian Sequence Prediction. , (informal publication)
  Electronic Edition (link) BibTeX [cs.LG/0301014]
• Giorgio Parisi:
  Some remarks on the survey decimation algorithm for K-satisfiability. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0301015]
• Peter Bürgisser, Martin Lotz:
  Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0301016]
• Millist W. Vincent, Jixue Liu:
  Completeness and Decidability Properties for Functional Dependencies in XML. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DB/0301017]
• Srinidhi Varadarajan, Naren Ramakrishnan:
  Novel Runtime Systems Support for Adaptive Compositional Modeling on the Grid. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CE/0301018]
• Daniel A. Spielman, Shang-Hua Teng:
  Smoothed Analysis of Interior-Point Algorithms: Termination. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0301019]
• Pierre Dusart, Gilles Letourneux, Olivier Vivolo:
  Differential Fault Analysis on A.E.S. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CR/0301020]
• Lauro Lins, Sóstenes Lins, Silvio Melo:
  PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0301021]
• Dima Grigoriev, Ilia V. Ponomarenko:
  Homomorphic public-key cryptosystems and encrypting boolean circuits. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CR/0301022]
• Torsten Schaub, Kewen Wang:
  A semantic framework for preference handling in answer set programming. , (informal publication)
  Electronic Edition (link) BibTeX [cs.AI/0301023]
• Jean-Luc Brylinski, Ranee Brylinski:
  Complexity and Completeness of Immanants. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0301024]
• Lauro Lins, Sóstenes Lins, Silvio Melo:
  PHORMA: Perfectly Hashed Order Restricted Multidimensional Array. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DM/0301025]
• Michael Beeson, Robert Veroff, Larry Wos:
  Double-Negation Elimination in Some Propositional Logics. , (informal publication)
  Electronic Edition (link) BibTeX [cs.LO/0301026]
• Thomas Wolf:
  A comparison of four approaches to the calculation of conservation laws. , (informal publication)
  Electronic Edition (link) BibTeX [cs.SC/0301027]
• Thomas Wolf:
  The integration of systems of linear PDEs using conservation laws of syzygies. , (informal publication)
  Electronic Edition (link) BibTeX [cs.SC/0301028]
• Thomas Wolf:
  Size reduction and partial decoupling of systems of equations. , (informal publication)
  Electronic Edition (link) BibTeX [cs.SC/0301029]
• Ronald I. Greenberg:
  Bounds on the Number of Longest Common Subsequences. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DM/0301030]
• Katarzyna Keahey, Von Welch:
  Fine-Grain Authorization for Resource Management in the Grid Environment. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CR/0301031]
• Oleg Kiselyov:
  Subclassing errors, OOP, and practically checkable rules to prevent them. , (informal publication)
  Electronic Edition (link) BibTeX [cs.PL/0301032]
• 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. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DC/0301033]
• Ronald I. Greenberg:
  Computing the Number of Longest Common Subsequences. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0301034]
• Alex Brodsky, Jan Bækgaard Pedersen, Alan S. Wagner:
  On the Complexity of Buffer Allocation in Message Passing Systems. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DC/0301035]
• Joe Francoeur:
  Algorithms using Java for Spreadsheet Dependent Cell Recomputation. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0301036]
• David Aldous, Allon G. Percus:
  Scaling and Universality in Continuous Length Combinatorial Optimization. , (informal publication)
  Electronic Edition (link) BibTeX [cond-mat/0301035]
• Wolfgang Barthel, Alexander K. Hartmann, Martin Weigt:
  Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms. , (informal publication)
  Electronic Edition (link) BibTeX [cond-mat/0301271]
• Guilhem Semerjian, Rémi Monasson:
  Relaxation and Metastability in the RandomWalkSAT search procedure. , (informal publication)
  Electronic Edition (link) BibTeX [cond-mat/0301272]
• Constantino Tsallis, Celia Anteneodo, Lisa Borland, Roberto Osorio:
  Nonextensive statistical mechanics and economics. , (informal publication)
  Electronic Edition (link) BibTeX [cond-mat/0301307]
• Kagan Tumer, David Wolpert:
  Collectives for the Optimal Combination of Imperfect Objects. , (informal publication)
  Electronic Edition (link) BibTeX [cond-mat/0301459]
• Bernd Fiedler:
  On the symmetry classes of the first covariant derivatives of tensor fields. , (informal publication)
  Electronic Edition (link) BibTeX [math.CO/0301042]
• N. Raghavendra:
  Binary trees and fibred categories. , (informal publication)
  Electronic Edition (link) BibTeX [math.CO/0301211]
• David Wolpert, Kagan Tumer, Esfandiar Bandari:
  Improving Search Algorithms by Using Intelligent Coordinates. , (informal publication)
  Electronic Edition (link) BibTeX [math.OC/0301268]
• Toby Ord, Tien D. Kieu:
  On the existence of a new family of Diophantine equations for Omega. , (informal publication)
  Electronic Edition (link) BibTeX [math.NT/0301274]
• Charles Ofria, Christoph Adami, Travis C. Collier:
  Selective pressures on genomes in molecular evolution. , (informal publication)
  Electronic Edition (link) BibTeX [quant-ph/0301075]