2434 search results - page 393 / 487 » Algorithmic Randomness of Closed Sets |
156
click to vote
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
110
click to vote
APPROX
2007
Springer
15 years 7 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
147
click to vote
NETWORKING
2008
15 years 4 months ago
2008
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates...
127
click to vote
NIPS
2004
15 years 4 months ago
2004
A generative probabilistic model for objects in images is presented. An object consists of a constellation of features. Feature appearance and pose are modeled probabilistically. ...
110
click to vote
WSC
1998
15 years 4 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...