3894 search results - page 409 / 779 » Approximation Algorithms for Biclustering Problems |
153
Voted
EACL
2009
ACL Anthology
16 years 5 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...
241
click to vote
VLDB
2006
ACM
16 years 5 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...
172
click to vote
PODS
2006
ACM
16 years 5 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 ...
118
click to vote
EUROPAR
2007
Springer
15 years 11 months 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...
133
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...