552 search results - page 48 / 111 » Observable Graphs |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
UAI
1994
13 years 9 months ago
1994
Wepresenta symbolicmachinerythatadmits bothprobabilisticand causalinformation abouta givendomainand producesprobabilisticstatementsabouttheeffectofactions andtheimpactof observati...
IPPS
2002
IEEE
14 years 28 days ago
2002
IEEE
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...
MCPR2
2011
12 years 11 months ago
2011
We present a strategy that combines color and depth images to detect people in indoor environments. Similarity of image appearance and closeness in 3D position over time yield weig...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...