Sciweavers

1109 search results - page 180 / 222
» Query Processing, Approximation, and Resource Management in ...
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 8 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
DAWAK
1999
Springer
14 years 1 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
SOSP
2005
ACM
14 years 5 months ago
The taser intrusion recovery system
Recovery from intrusions is typically a very time-consuming operation in current systems. At a time when the cost of human resources dominates the cost of computing resources, we ...
Ashvin Goel, Kenneth Po, Kamran Farhadi, Zheng Li,...
CIKM
2008
Springer
13 years 10 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
HICSS
1999
IEEE
193views Biometrics» more  HICSS 1999»
14 years 1 months ago
Web-based Access to Distributed High-Performance Geographic Information Systems for Decision Support
A number of applications that use GIS for decision support can potentially be enhanced by the use of high-performance computers, broadband networks and mass data stores. We descri...
Paul D. Coddington, Kenneth A. Hawick, Heath A. Ja...