865 search results - page 95 / 173 » Random graph models for the web graph |
169
click to vote
SIGIR
2011
ACM
14 years 6 months ago
2011
ACM
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
154
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
130
click to vote
HICSS
2006
IEEE
15 years 10 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
150
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
147
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...