5316 search results - page 1014 / 1064 » Which Search Problems Are Random |
120
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. We introduce a shape detection framework called Contour Context Selection for detecting objects in cluttered images using only one exemplar. Shape based detection is inva...
188
click to vote
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
107
click to vote
KDD
2005
ACM
16 years 1 months ago
2005
ACM
Addressed in this paper is the issue of `email data cleaning' for text mining. Many text mining applications need take emails as input. Email data is usually noisy and thus i...
207
click to vote
SIGMOD
2008
ACM
16 years 28 days ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
120
Voted
SIGMOD
2001
ACM
16 years 28 days ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...