Sciweavers

3422 search results - page 584 / 685
» Random Subset Optimization
Sort
View
RECOMB
2004
Springer
16 years 2 months ago
Aligning alignments exactly
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Dean Starrett
126
Voted
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 2 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
ICALP
2009
Springer
16 years 2 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
ICDE
2010
IEEE
224views Database» more  ICDE 2010»
16 years 2 months ago
Probabilistic Declarative Information Extraction
Abstract-Unstructured text represents a large fraction of the world's data. It often contain snippets of structured information within them (e.g., people's names and zip ...
Daisy Zhe Wang, Eirinaios Michelakis, Joseph M. He...
113
Voted
DCC
2005
IEEE
16 years 2 months ago
When is Bit Allocation for Predictive Video Coding Easy?
This paper addresses the problem of bit allocation among frames in a predictively encoded video sequence. Finding optimal solutions to this problem potentially requires making an ...
Yegnaswamy Sermadevi, Jun Chen, Sheila S. Hemami, ...