4372 search results - page 241 / 875 » Algorithmic Theories of Everything |
147
click to vote
CAV
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
188
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
127
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...
166
click to vote
TON
2002
15 years 5 months ago
2002
Abstract--Research on congestion-control algorithms has traditionally focused more on performance than on robustness of the closed-loop system to changes in network conditions. As ...
158
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...