61 search results - page 8 / 13 » Lower bounds for graph embeddings and combinatorial precondi... |
161
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
163
click to vote
FOCS
2006
IEEE
16 years 3 days ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
154
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
154
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
176
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...