1871 search results - page 208 / 375 » The Ephemeral Pairing Problem |
195
click to vote
ICDT
2012
ACM
13 years 9 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
185
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
172
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Detecting image pairs with a common field of view is
an important prerequisite for many computer vision tasks.
Typically, common local features are used as a criterion
for ident...
201
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
178
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Unsupervised categorization of images or image parts is often needed for image and video summarization or as a preprocessing step in supervised methods for classification, trackin...