3637 search results - page 641 / 728 » On Dynamic Bit-Probe Complexity |
185
click to vote
UAI
1997
15 years 7 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
201
click to vote
MOBICOM
2010
ACM
15 years 6 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
155
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
153
click to vote
ALIFE
2007
15 years 6 months ago
2007
: Reliably recognizing objects approaching on a collision course is extremely important. In this paper, a synthetic vision system is proposed to tackle the problem of collision rec...
183
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: A molecular network perspective forms the foundation of systems biology. A common practice in analyzing protein-protein interaction (PPI) networks is to perform networ...