Sciweavers

3637 search results - page 641 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
UAI
1997
13 years 11 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
MOBICOM
2010
ACM
13 years 10 months ago
Differential forms for target tracking and aggregate queries in distributed networks
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...
Rik Sarkar, Jie Gao
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
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....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
ALIFE
2007
13 years 10 months ago
A Synthetic Vision System Using Directionally Selective Motion Detectors to Recognize Collision
: 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...
Shigang Yue, F. Claire Rind
BMCBI
2010
164views more  BMCBI 2010»
13 years 10 months ago
Investigating the validity of current network analysis on static conglomerate networks by protein network stratification
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...
Minlu Zhang, Long J. Lu