3874 search results - page 401 / 775 » Approximation Algorithms for k-hurdle Problems |
162
Voted
SODA
2010
ACM
15 years 5 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
187
click to vote
EACL
2009
ACL Anthology
16 years 7 months ago
2009
ACL Anthology
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
293
click to vote
VLDB
2006
ACM
16 years 7 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
221
Voted
PODS
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
153
click to vote
EUROPAR
2007
Springer
16 years 27 days ago
2007
Springer
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...