Sciweavers

398 search results - page 57 / 80
» Ant Algorithm for the Graph Matching Problem
Sort
View
MP
2010
163views more  MP 2010»
13 years 2 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
11 years 10 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 1 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
ICPR
2000
IEEE
14 years 8 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»
13 years 6 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