Sciweavers

2754 search results - page 66 / 551
» Distributed Weighted Matching
Sort
View
FOCS
2008
IEEE
14 years 5 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
CVPR
2008
IEEE
15 years 27 days ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
DEBS
2010
ACM
13 years 5 months ago
Distributed structural and value XML filtering
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
Iris Miliaraki, Manolis Koubarakis
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 5 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
ICPR
2008
IEEE
15 years 2 days ago
Multiple kernel learning from sets of partially matching image features
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...