Sciweavers

253 search results - page 33 / 51
» Random Walks with Look-Ahead in Scale-Free Random Graphs
Sort
View
PAKDD
2010
ACM
179views Data Mining» more  PAKDD 2010»
15 years 4 months ago
Answer Diversification for Complex Question Answering on the Web
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
Palakorn Achananuparp, Xiaohua Hu, Tingting He, Ch...
FOCS
2009
IEEE
15 years 6 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer
ITA
2006
163views Communications» more  ITA 2006»
14 years 11 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
ICCV
2009
IEEE
16 years 4 months ago
Correlated Probabilistic Trajectories for Pedestrian Motion Detection
This paper introduces an algorithm for detecting walking motion using point trajectories in video sequences. Given a number of point trajectories, we identify those which are sp...
Frank Perbet, Atsuto Maki, Bjorn Stenger
CORR
2006
Springer
119views Education» more  CORR 2006»
14 years 11 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...