Sciweavers

2485 search results - page 297 / 497
» Time Bounded Frequency Computations
Sort
View
ISMB
1993
13 years 9 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
CONCUR
2010
Springer
13 years 8 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini
NAACL
2010
13 years 6 months ago
Distributed Training Strategies for the Structured Perceptron
Perceptron training is widely applied in the natural language processing community for learning complex structured models. Like all structured prediction learning frameworks, the ...
Ryan T. McDonald, Keith Hall, Gideon Mann
MFCS
2001
Springer
14 years 19 days ago
The k-Median Problem for Directed Trees
Abstract Marek Chrobak1 , Lawrence L. Larmore2 , and Wojciech Rytter3,4 1 Department of Computer Science, University of California Riverside, CA 92521 2 Department of Computer Scie...
Marek Chrobak, Lawrence L. Larmore, Wojciech Rytte...
FOCS
2008
IEEE
14 years 2 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty