Sciweavers

557 search results - page 66 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
DICTA
2003
15 years 15 days ago
Probabilistic Multiple Cue Integration for Particle Filter Based Tracking
Robust visual tracking has become an important topic in the field of computer vision. The integration of cues such as color, edge strength and motion has proved to be a promising ...
Chunhua Shen, Anton van den Hengel, Anthony R. Dic...
ICMLA
2009
14 years 8 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
ICASSP
2011
IEEE
14 years 2 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
15 years 5 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
OA
1989
237views Algorithms» more  OA 1989»
15 years 3 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph