Sciweavers

2297 search results - page 72 / 460
» A fast APRIORI implementation
Sort
View
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
15 years 11 months ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...
ACSC
2009
IEEE
15 years 5 months ago
Fast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
Nikolas Askitis
ACCV
2007
Springer
15 years 5 months ago
Fast Optimal Three View Triangulation
We consider the problem of L2-optimal triangulation from three separate views. Triangulation is an important part of numerous computer vision systems. Under gaussian noise, minimiz...
Martin Byröd, Klas Josephson, Kalle Åst...
ECRTS
2005
IEEE
15 years 4 months ago
Fast Component Interaction for Real-Time Systems
Open real-time systems provide for co-hosting hard-, soft- and non-real-time applications. Microkernel-based designs in addition allow for these applications to be mutually protec...
Udo Steinberg, Jean Wolter, Hermann Härtig
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
15 years 3 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian