Sciweavers

27 search results - page 5 / 6
» Semi-naive evaluation in linear tabling
Sort
View
EDBT
2009
ACM
165views Database» more  EDBT 2009»
13 years 4 months ago
Exploiting the power of relational databases for efficient stream processing
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
Erietta Liarou, Romulo Goncalves, Stratos Idreos
SIGMETRICS
1991
ACM
13 years 9 months ago
Implementing Stack Simulation for Highly-Associative Memories
Prior to this work, all implementations of stack simulation [MGS70] required more than linear time to process an address trace. In particular these implementations are often slow ...
Yul H. Kim, Mark D. Hill, David A. Wood
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
13 years 11 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
IDEAS
2007
IEEE
135views Database» more  IDEAS 2007»
14 years 18 days ago
Bitmap Index Design Choices and Their Performance Implications
Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of t...
Elizabeth J. O'Neil, Patrick E. O'Neil, Kesheng Wu
CVPR
2008
IEEE
14 years 8 months ago
Classification using intersection kernel support vector machines is efficient
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...
Subhransu Maji, Alexander C. Berg, Jitendra Malik