154 search results - page 17 / 31 » Optimization problems in multiple subtree graphs |
ESA
2008
Springer
14 years 11 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
NIPS
2008
14 years 11 months ago
2008
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
PE
2008
Springer
14 years 9 months ago
2008
Springer
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...