211 search results - page 32 / 43 » BoostMap: A Method for Efficient Approximate Similarity Rank... |
ICCD
1991
IEEE
13 years 11 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
VLDB
2002
ACM
14 years 7 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
UAI
2004
13 years 9 months ago
2004
A Bayesian belief network is a model of a joint distribution over a finite set of variables, with a DAG structure representing immediate dependencies among the variables. For each...
DATAMINE
2006
13 years 7 months ago
2006
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...