Sciweavers

1327 search results - page 164 / 266
» Path following algorithm for the graph matching problem
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 9 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
FCT
2003
Springer
15 years 9 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 4 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
ICPR
2000
IEEE
16 years 4 months ago
Attributed Tree Homomorphism Using Association Graphs
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi,...
PR
2010
160views more  PR 2010»
15 years 2 months ago
Homeomorphic alignment of weighted trees
Motion capture, a currently active research area, needs estimation of the pose of the subject. For this purpose, we match the tree representation of the skeleton of the 3D shape t...
Benjamin Raynal, Michel Couprie, Venceslas Biri