Sciweavers

317 search results - page 30 / 64
» Computing and Updating the Process Number in Trees
Sort
View
IPPS
2010
IEEE
14 years 11 months ago
Optimization of linked list prefix computations on multithreaded GPUs using CUDA
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
Zheng Wei, Joseph JáJá
PAMI
2011
14 years 8 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
FPGA
2009
ACM
168views FPGA» more  FPGA 2009»
14 years 11 months ago
Large-scale wire-speed packet classification on FPGAs
Multi-field packet classification is a key enabling function of a variety of network applications, such as firewall processing, Quality of Service differentiation, traffic billing...
Weirong Jiang, Viktor K. Prasanna
PDP
2008
IEEE
15 years 7 months ago
Distributed Sparse Spatial Selection Indexes
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
Veronica Gil Costa, Mauricio Marín
PRIS
2004
15 years 2 months ago
Similarity Range Queries in Streaming Time Series
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
Maria Kontaki, Apostolos Papadopoulos, Yannis Mano...