4536 search results - page 621 / 908 » Contention-Sensitive Data Structures and Algorithms |
325
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
251
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
168
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper introduces a tracking method for the well known local MSER (Maximally Stable Extremal Region) detector. The component tree is used as an efficient data structure, which...
174
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Several domains such as sports, surgery, dance etc. are characterized by a significant influence of expertise of the performer on the motion pattern and style. The retrieval of ex...
168
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...