2168 search results - page 76 / 434 » Randomized Algorithms and Complexity Theory |
120
click to vote
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
145
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
124
click to vote
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
151
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
185
click to vote
SIAMMAX
2010
14 years 9 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...