1486 search results - page 156 / 298 » Algorithms for two-box covering |
103
click to vote
RANDOM
1998
Springer
15 years 8 months ago
1998
Springer
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
131
click to vote
EMNLP
2007
15 years 5 months ago
2007
In this paper, we describe a new algorithm for recovering WH-trace empty nodes. Our approach combines a set of hand-written patterns together with a probabilistic model. Because t...
140
click to vote
SIROCCO
1998
15 years 5 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
108
click to vote
IJCAI
1997
15 years 5 months ago
1997
We consider algorithms of the Waltz type for computing local consistency (also called arcconsistency) for constraints over numeric domains. Many commonlyused propagationrules do n...
152
Voted
DC
2010
15 years 4 months ago
2010
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...