Sciweavers

733 search results - page 52 / 147
» Recommending random walks
Sort
View
CVPR
2012
IEEE
13 years 9 days ago
Model recommendation for action recognition
Simply choosing one model out of a large set of possibilities for a given vision task is a surprisingly difficult problem, especially if there is limited evaluation data with whi...
Pyry Matikainen, Rahul Sukthankar, Martial Hebert
CSCW
2012
ACM
13 years 5 months ago
Recommending routes in the context of bicycling: algorithms, evaluation, and the value of personalization
Users have come to rely on automated route finding services for driving, public transit, walking, and bicycling. Current state of the art route finding algorithms typically rely...
Reid Priedhorsky, David Pitchford, Shilad Sen, Lor...
COCOON
2009
Springer
15 years 4 months ago
Sublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
CPC
2006
92views more  CPC 2006»
14 years 10 months ago
Waiting for a Bat to Fly By (in Polynomial Time)
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
Itai Benjamini, Gady Kozma, László L...
CN
2000
92views more  CN 2000»
14 years 9 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon