Sciweavers

629 search results - page 24 / 126
» The Generalized Quantum Database Search Algorithm
Sort
View
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
14 years 6 days ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 8 months ago
Query biased snippet generation in XML search
Snippets are used by almost every text search engine to complement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance ...
Yu Huang, Ziyang Liu, Yi Chen
PODS
1997
ACM
182views Database» more  PODS 1997»
14 years 24 days ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
GIS
2007
ACM
14 years 9 months ago
Environmental scenario search and visualization
We have developed Environmental Scenario Search Engine (ESSE) for parallel data mining of a set of conditions inside distributed, very large databases from multiple environmental ...
Mikhail N. Zhizhin, Eric A. Kihn, Vassily Lyutsare...
CIKM
2009
Springer
14 years 3 months ago
Maximal metric margin partitioning for similarity search indexes
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...