Sciweavers

776 search results - page 75 / 156
» Distributed Information Regularization on Graphs
Sort
View
143
Voted
CIKM
2010
Springer
15 years 1 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
118
Voted
ICPR
2008
IEEE
16 years 4 months ago
Segmentation by combining parametric optical flow with a color model
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
Adrian Ulges, Thomas M. Breuel
120
Voted
CIKM
2004
Springer
15 years 8 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
134
Voted
GIS
2010
ACM
15 years 23 days ago
Querying geo-social data by bridging spatial networks and social networks
Recording the location of people using location-acquisition technologies, such as GPS, allows generating life patterns, which associate people to places they frequently visit. Con...
Yerach Doytsher, Ben Galon, Yaron Kanza
118
Voted
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 4 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro