203 search results - page 12 / 41 » Random walks on graphs to model saliency in images |
100
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
80
Voted
ENTCS
2008
15 years 13 days ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
127
click to vote
INFOCOM
2009
IEEE
15 years 7 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...
106
Voted
BC
2008
15 years 14 days ago
2008
Abstract In this study we set to investigate visual attention properties of freely behaving barn owls using a miniature wireless camera attached to their heads. The tubular eye str...
117
Voted
IJAHUC
2008
15 years 11 days ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...