Sciweavers

4137 search results - page 335 / 828
» On the number of matchings of a tree
Sort
View
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 6 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
CVPR
2005
IEEE
16 years 8 months ago
Real-Time Non-Rigid Surface Detection
We present a real-time method for detecting deformable surfaces, with no need whatsoever for a priori pose knowledge. Our method starts from a set of wide baseline point matches b...
Julien Pilet, Vincent Lepetit, Pascal Fua
ICCV
2001
IEEE
16 years 8 months ago
Joint Feature Distributions for Image Correspondence
We introduce `Joint Feature Distributions', a general statistical framework for feature based multi-image matching that explicitly models the joint probability distributions ...
Bill Triggs
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 7 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
ICDAR
2009
IEEE
16 years 1 months ago
A Survey of Techniques for Document and Archaeology Artefact Reconstruction
An automated assembling of shredded/torn documents (2D) or broken pottery (3D) will support philologists, archaeologists and forensic experts. An automated solution for this task ...
Florian Kleber, Robert Sablatnig