6110 search results - page 139 / 1222 » Approximate Computing |
170
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
176
click to vote
ISMB
1998
15 years 7 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
144
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
165
click to vote
IPMU
2010
Springer
15 years 4 months ago
2010
Springer
It is well known that among all probabilistic graphical Markov models the class of decomposable models is the most advantageous in the sense that the respective distributions can b...
205
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...