Sciweavers

4541 search results - page 455 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
AAAI
2008
15 years 7 months ago
Multi-HDP: A Non Parametric Bayesian Model for Tensor Factorization
Matrix factorization algorithms are frequently used in the machine learning community to find low dimensional representations of data. We introduce a novel generative Bayesian pro...
Ian Porteous, Evgeniy Bart, Max Welling
125
Voted
CORR
2011
Springer
189views Education» more  CORR 2011»
15 years 1 days ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König
WWW
2009
ACM
16 years 5 months ago
Graph based crawler seed selection
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles
IPPS
1998
IEEE
15 years 9 months ago
Mechanically Verifying the Correctness of the Fast Fourier Transform in ACL2
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
Ruben Gamboa
139
Voted
IPPS
1998
IEEE
15 years 9 months ago
Managing Concurrent Access for Shared Memory Active Messages
Passing messages through shared memory plays an important role on symmetric multiprocessors and on Clumps. The management of concurrent access to message queues is an important as...
Steven Lumetta, David E. Culler