CoRR, April 2003

• Norman G. Vinson:
  Design Guidelines for Landmarks to Support Navigation in Virtual Environments.
  
• Paul M. Aoki, Matthew Romaine, Margaret H. Szymanski, James D. Thornton, Daniel Wilson, Allison Woodruff:
  The Mad Hatter's Cocktail Party: A Social Mobile Audio Space Supporting Multiple Simultaneous Conversations.
  
• Farn Wang, Geng-Dian Hwang, Fang Yu:
  TCTL Inevitability Analysis of Dense-time Systems.
  
• Martin Ziegler:
  Quasi-Optimal Arithmetic for Quaternion Polynomials.
  
• Oded Regev:
  Quantum Computation and Lattice Problems.
  
• Regina Barzilay, Lillian Lee:
  Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence Alignment.
  
• Slobodan Petrovic, Gonzalo Álvarez:
  A Method for Clustering Web Attacks Using Edit Distance.
  
• Stephen A. Fenner:
  A Physics-Free Introduction to the Quantum Computation Model.
  
• Gilles Daniel:
  Stochastic Volatility in a Quantitative Model of Stock Market Returns.
  
• Boaz Tsaban, Uzi Vishne:
  Efficient linear feedback shift registers with maximal period.
  
• Paul Anderson, Goncalo Carvalho:
  Embedded Reflection Mapping.
  
• Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi:
  Individual Communication Complexity.
  
• Ilia Toli:
  Hidden Polynomial(s) Cryptosystems.
  
• Andreas Winter, Anderson C. A. Nascimento, Hideki Imai:
  Commitment Capacity of Discrete Memoryless Channels.
  
• Xuehai Zhang, Jeffrey L. Freschl, Jennifer M. Schopf:
  A Performance Study of Monitoring and Information Services for Distributed Systems.
  
• John Robert Burger:
  Symmetric and Antisymmeteric Functions, a New Way to Test a Quantum Computer.
  
• Nachum Dershowitz:
  Ground Canonicity.
  
• David Eppstein:
  Quasiconvex Analysis of Backtracking Algorithms.
  
• David N. Levin:
  Blind Normalization of Speech From Different Channels.
  
• Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
  A direct sum theorem in communication complexity via message compression.
  
• Peter Buchholz, Peter Kemper:
  Model Checking for a Class of Weighted Automata.
  
• Arnold Smith, Peter D. Turney, Robert Ewaschuk:
  Self-Replicating Machines in Continuous Space with Virtual Physics.
  
• Mirela Damian-Iordache, Joseph O'Rourke:
  Partitioning Regular Polygons into Circular Pieces I: Convex Partitions.
  
• Victor Kromer:
  Glottochronologic Retrognostic of Language System.
  
• Joseph O'Rourke:
  Computational Geometry Column 44.
  
• Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev:
  A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover.
  
• Lillian Lee:
  "I'm sorry Dave, I'm afraid I can't do that": Linguistics, Statistics and Natural Language Processing circa 2001.
  
• Baden Hughes, Steven Bird:
  Grid-Enabling Natural Language Engineering By Stealth.
  
• Dietmar Rösner, Manuela Kunze:
  An XML based Document Suite.
  
• John M. Hitchcock:
  Small Spans in Scaled Dimension.
  
• Douglas A. Galbi:
  Transforming the Structure of Network Interconnection and Transport.
  
• Douglas A. Galbi:
  Growth in the "New Economy": U.S. Bandwidth Use and Pricing Across the 1990s.
  
• Douglas A. Galbi:
  A New Account of Personalization and Effective Communication.
  
• Douglas A. Galbi:
  Revolutionary Ideas for Radio Regulation.
  
• Dietmar Rösner, Manuela Kunze:
  Exploiting Sublanguage and Domain Characteristics in a Bootstrapping Approach to Lexicon and Ontology Creation.
  
• Manuela Kunze, Chun Xiao:
  An Approach for Resource Sharing in Multilingual NLP.
  
• Sudharshan Vazhkudai, Jennifer M. Schopf:
  Using Regression Techniques to Predict Large Data Transfers.
  
• Sanjeev Arora:
  How NP got a new definition: a survey of probabilistically checkable proofs.
  
• Uriel Feige:
  Approximation thresholds for combinatorial optimization problems.
  
• Russell Impagliazzo:
  Hardness as randomness: a survey of universal derandomization.
  
• Ran Raz:
  P != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle.
  
• Asa Ben-Hur, Alexander Roitershtein, Hava T. Siegelmann:
  On probabilistic analog automata.
  
• Stefan Weinzierl:
  gTybalt - a free computer algebra system.
  
• Michael N. Vyalyi:
  Hardness of approximating the weight enumerator of a binary linear code.
  
• Simone Severini:
  On a composition of digraphs.
  
• Carlo Montangero, Laura Semini:
  Distributed States Temporal Logic.
  
• Juhi-Lian Julian Ting:
  Causalities of the Taiwan Stock Market.
  
• Juhani Karhumäki, Jeffrey Shallit:
  Polynomial versus Exponential Growth in Repetition-Free Binary Words.
  
• J. Maurice Rojas:
  A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture.
  
• Mireille Boutin, Gregor Kemper:
  On reconstructing n-point configurations from the distribution of distances or areas.
  
• Alexei D. Miasnikov, Alexei G. Myasnikov:
  Whitehead method and Genetic Algorithms.
  
• Alexei D. Miasnikov, Alexei G. Myasnikov:
  Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture.
  
• Alexei D. Miasnikov:
  Genetic algorithms and the Andrews-Curtis conjecture.
  
• Gábor Megyesi, Frank Sottile:
  The envelope of lines meeting a fixed line that are tangent to two spheres.
  
• Jeffrey Shallit:
  Simultaneous avoidance of large squares and fractional powers in infinite binary words.
  
• Pontus Svenson, Hedvig Sidenbladh:
  Determining possible avenues of approach using ANTS.
  
• Gianluca Argentini:
  Message Passing Fluids: molecules as processes in parallel computational fluids.
  
• Peter Høyer, Michele Mosca, Ronald de Wolf:
  Quantum Search on Bounded-Error Inputs.
  
• Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig:
  Multiparty Quantum Coin Flipping.
  
• Tien D. Kieu:
  Numerical simulations of a quantum algorithm for Hilbert's tenth problem.
  
• Zbyszek P. Karkuszewski:
  Harmonic inversion helps to beat time-energy uncertainty relations.
  

Last update Sat May 25 19:54:12 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page