Sciweavers

664 search results - page 34 / 133
» Generalized Search Trees for Database Systems
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 4 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
CVPR
1997
IEEE
16 years 6 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
SIGMOD
2011
ACM
282views Database» more  SIGMOD 2011»
14 years 7 months ago
SkylineSearch: semantic ranking and result visualization for pubmed
Life sciences researchers perform scientific literature search as part of their daily activities. Many such searches are executed against PubMed, a central repository of life sci...
Julia Stoyanovich, Mayur Lodha, William Mee, Kenne...
PUK
2003
15 years 5 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
GEOINFORMATICA
1998
144views more  GEOINFORMATICA 1998»
15 years 4 months ago
Approximation-Based Similarity Search for 3-D Surface Segments
The issue of ®nding similar 3-D surface segments arises in many recent applications of spatial database systems, such as molecular biology, medical imaging, CAD, and geographic i...
Hans-Peter Kriegel, Thomas Seidl