Sciweavers

1425 search results - page 31 / 285
» Beyond Dependency Graphs
Sort
View
117
Voted
NAACL
2010
15 years 15 days ago
Relaxed Marginal Inference and its Application to Dependency Parsing
Recently, relaxation approaches have been successfully used for MAP inference on NLP problems. In this work we show how to extend the relaxation approach to marginal inference use...
Sebastian Riedel, David A. Smith
140
Voted
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
16 years 7 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
142
Voted
AGTIVE
1999
Springer
15 years 6 months ago
Graph Algorithm Animation with Grrr
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
Peter J. Rodgers, Natalia Vidal
160
Voted
CVPR
2012
IEEE
13 years 5 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
IM
2006
15 years 2 months ago
Using PageRank to Characterize Web Structure
Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on "local" p...
Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal