1887 search results - page 30 / 378 » An efficient search algorithm for partially ordered sets |
SIGMOD
2010
ACM
13 years 5 months ago
2010
ACM
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
ICSE
2004
IEEE-ACM
14 years 7 months ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
MICAI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...