CoRR, May 2002

• Almut Burchard, Jörg Liebeherr, Stephen D. Patek:
  A Calculus for End-to-end Statistical Service Guarantees.
  
• Joachim Rosenthal:
  A Polynomial Description of the Rijndael Advanced Encryption Standard.
  
• Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore:
  The prospects for mathematical logic in the twenty-first century.
  
• Srinidhi Varadarajan, Joy Mukherjee, Naren Ramakrishnan:
  Weaves: A Novel Direct Code Execution Interface for Parallel High Performance Scientific Codes.
  
• Robert A. Hearn, Erik D. Demaine:
  PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation.
  
• Marco Baroni, Johannes Matiasek, Harald Trost:
  Unsupervised discovery of morphologically related words based on orthographic and semantic similarity.
  
• Neal E. Young:
  On-Line Paging against Adversarially Biased Random Inputs.
  
• Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young:
  Improved Bicriteria Existence Theorems for Scheduling.
  
• Rie Kubota Ando, Lillian Lee:
  Mostly-Unsupervised Statistical Segmentation of Japanese Kanji Sequences.
  
• Yossi Matias, Jeffrey Scott Vitter, Neal E. Young:
  Approximate Data Structures with Applications.
  
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  On Strongly Connected Digraphs with Bounded Cycle Length.
  
• Claire Kenyon, Nicolas Schabanel, Neal E. Young:
  Polynomial-Time Approximation Scheme for Data Broadcast.
  
• Zbigniew Lonc, Miroslaw Truszczynski:
  Computing stable models: worst-case performance estimates.
  
• Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski:
  Ultimate approximations in nonmonotonic knowledge representation systems.
  
• Michael Farber:
  Instabilities of Robot Motion.
  
• Jing Han, Jiming Liu, Qingsheng Cai:
  From Alife Agents to a Kingdom of N Queens.
  
• Georgios Petasis, Vangelis Karkaletsis, Georgios Paliouras, Ion Androutsopoulos, Constantine D. Spyropoulos:
  Ellogon: A New Text Engineering Platform.
  
• Ralf Lämmel:
  Typed Generic Traversal With Term Rewriting Strategies.
  
• W. Chen:
  Distance function wavelets - Part I: Helmholtz and convection-diffusion transforms and series.
  
• W. Chen:
  A quasi-RBF technique for numerical discretization of PDE's.
  
• Anders Wäänänen, Mattias Ellert, Aleksandr Konstantinov, Balázs Kónya, Oxana Smirnova:
  An Overview of a Grid Architecture for Scientific Computing.
  
• Naren Ramakrishnan:
  The Traits of the Personable.
  
• Mattias Ellert, Aleksandr Konstantinov, Balázs Kónya, Oxana Smirnova, Anders Wäänänen:
  Performance evaluation of the GridFTP within the NorduGrid project.
  
• Evgueniy Vitchev:
  A (non)static 0-order statistical model and its implementation for compressing virtually uncompressible data.
  
• Menno van Zaanen:
  Bootstrapping Structure into Language: Alignment-Based Learning.
  
• Chung-chieh Shan:
  Monads for natural language semantics.
  
• Chung-chieh Shan:
  A variable-free dynamic semantics.
  
• Edward Loper, Steven Bird:
  NLTK: The Natural Language Toolkit.
  
• Qin Zhang, John M. Danskin, Neal E. Young:
  A Codebook Generation Algorithm for Document Image Compression.
  
• Stavros G. Kolliopoulos, Neal E. Young:
  Tight Approximation Results for General Covering Integer Programs.
  
• László Lovász, Neal E. Young:
  Lecture Notes on Evasiveness of Graph Properties.
  
• Naveen Garg, Neal E. Young:
  On-Line End-to-End Congestion Control.
  
• Neal E. Young:
  On-Line File Caching.
  
• Robert Lupton, F. Miller Maley, Neal E. Young:
  Data-Collection for the Sloan Digital Sky Survey: a Network-Flow Heuristic.
  
• Richard J. Lipton, Neal E. Young:
  Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory.
  
• Neal E. Young:
  Randomized Rounding without Solving the Linear Program.
  
• Samir Khuller, Uzi Vishkin, Neal E. Young:
  A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover.
  
• Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
  Competitive Paging Algorithms.
  
• Neal E. Young:
  Sequential and Parallel Algorithms for Mixed Packing and Covering.
  
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  Approximating the Minimum Equivalent Digraph.
  
• Neal E. Young, Robert Endre Tarjan, James B. Orlin:
  Faster Parametric Shortest Path and Minimum Balance Algorithms.
  
• S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young:
  Orienting Graphs to Optimize Reachability.
  
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  Low-Degree Spanning Trees of Small Weight.
  
• Neal E. Young:
  The K-Server Dual and Loose Competitiveness for Paging.
  
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  Balancing Minimum Spanning and Shortest Path Trees.
  
• Philip N. Klein, Neal E. Young:
  On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms.
  
• Neal E. Young:
  K-Medians, Facility Location, and the Chernoff-Wald Bound.
  
• Mordecai J. Golin, Claire Kenyon, Neal E. Young:
  Huffman Coding with Unequal Letter Costs.
  
• Mordecai J. Golin, Neal E. Young:
  Prefix Codes: Equiprobable Words, Unequal Letter Costs.
  
• Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young:
  A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.
  
• David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
  Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut.
  
• Vasu S. Alagar, Ralf Lämmel:
  Three-Tiered Specification of Micro-Architectures.
  
• Paul M. Aoki, Rebecca E. Grinter, Amy Hurst, Margaret H. Szymanski, James D. Thornton, Allison Woodruff:
  Sotto Voce: Exploring the Interplay of Conversation and Mobile Audio Spaces.
  
• Allison Woodruff, Paul M. Aoki, Rebecca E. Grinter, Amy Hurst, Margaret H. Szymanski, James D. Thornton:
  Eavesdropping on Electronic Guidebooks: Observing Learning Resources in Shared Listening Environments.
  
• Allison Woodruff, Margaret H. Szymanski, Rebecca E. Grinter, Paul M. Aoki:
  Practical Strategies for Integrating a Conversation Analyst in an Iterative Design Process.
  
• Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
  Parameterized Intractability of Motif Search Problems.
  
• Mathias Creutz, Krista Lagus:
  Unsupervised Discovery of Morphemes.
  
• Alexei Novikov:
  Content Distribution in Unicast Replica Meshes.
  
• Saverio Perugini, Marcos André Gonçalves, Edward A. Fox:
  A Connection-Centric Survey of Recommender Systems Research.
  
• Christoph Koch:
  Optimizing Queries Using a Meta-level Database.
  
• Marek W. Gutowski:
  Aging, double helix and small world property in genetic algorithms.
  
• Michael A. Frumkin, Rob F. Van der Wijngaart:
  Minimizing Cache Misses in Scientific Computing Using Isoperimetric Bodies.
  
• W. Chen:
  Distance function wavelets - Part II: Extended results and conjectures.
  
• Charles Sauerbier:
  A polynomial time (heuristic) SAT algorithm.
  
• Regina Barzilay, Lillian Lee:
  Bootstrapping Lexical Choice via Multiple-Sequence Alignment.
  
• Benoît Hudson, Tuomas Sandholm:
  Effectiveness of Preference Elicitation in Combinatorial Auctions.
  
• Ted Pedersen:
  Evaluating the Effectiveness of Ensembles of Decision Trees in Disambiguating Senseval Lexical Samples.
  
• Ted Pedersen:
  Assessing System Agreement and Instance Difficulty in the Lexical Sample Tasks of Senseval-2.
  
• Ted Pedersen:
  Machine Learning with Lexical Features: The Duluth Approach to Senseval-2.
  
• Bo Pang, Lillian Lee, Shivakumar Vaithyanathan:
  Thumbs up? Sentiment Classification using Machine Learning Techniques.
  
• Xiaoming Liu, Tim Brody, Stevan Harnad, Les Carr, Kurt Maly, Mohammad Zubair, Michael L. Nelson:
  A Scalable Architecture for Harvest-Based Digital Libraries - The ODU/Southampton Experiments.
  
• Sylvain Neuvel, Sean A. Fulop:
  Unsupervised Learning of Morphology without Morphemes.
  
• Vincent Conitzer, Tuomas Sandholm:
  Vote Elicitation: Complexity and Strategy-Proofness.
  
• Vincent Conitzer, Tuomas Sandholm:
  Complexity Results about Nash Equilibria.
  
• Vincent Conitzer, Tuomas Sandholm:
  Complexity of Mechanism Design.
  
• Vincent Conitzer, Tuomas Sandholm:
  Complexity of Manipulating Elections with Few Candidates.
  
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  Designing Multi-Commodity Flow Trees.
  
• Larry Wos:
  A Spectrum of Applications of Automated Reasoning.
  
• Daniel J. Lehmann:
  Connectives in Quantum and other Cumulative Logics.
  
• Matus Marko, M. A. Porter, A. Probst, Carlos Gershenson, Atin Das:
  Transforming the World Wide Web into a Complexity-Based Semantic Network.
  
• David S. Dean, Satya N. Majumdar:
  Phase Transition in a Random Fragmentation Problem with Applications to Computer Science.
  
• Satya N. Majumdar, David S. Dean:
  Exact Solution of a Drop-push Model for Percolation.
  
• Jobst Heitzig:
  The asymptotic complexity of partial sorting -- How to learn large posets by pairwise comparisons.
  
• Julia Kempe:
  Quantum Random Walks Hit Exponentially Faster.
  
• Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp:
  Authentication of Quantum Messages.
  
• Barbara M. Terhal, David P. DiVincenzo:
  Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games.
  

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