1272 search results - page 99 / 255 » Approximate Parameterized Matching |
159
Voted
SODA
1992
ACM
15 years 4 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
121
Voted
IDEAL
2004
Springer
15 years 9 months ago
2004
Springer
AURA (Advanced Uncertain Reasoning Architecture) is a parallel pattern matching technology intended for high-speed approximate search and match operations on large unstructured dat...
131
click to vote
MICRO
1993
IEEE
15 years 7 months ago
1993
IEEE
In this paper, we present a novel mechanism that implements register renaming, dynamic speculation and precise interrupts. Renaming of registers is performed during the instructio...
145
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...
122
Voted
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— Many computer vision problems such as recognition, image retrieval, and tracking require matching two images. Currently, ones try to find as reliable as possible match...