1969 search results - page 261 / 394 » Challenges in Enterprise Search |
ALGORITHMICA
2005
13 years 8 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
ECIR
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. The structural heterogeneity and complexity of XML repositories makes query formulation challenging for users who have little knowledge of XML. To assist its users, an XM...
INFOCOM
2011
IEEE
12 years 12 months ago
2011
IEEE
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
Developing effective content recognition methods for diverse imagery continues to challenge computer vision researchers. We present a new approach for document image content catego...
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
2010
Eurographics
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...