Sciweavers

2745 search results - page 122 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
SOFSEM
2009
Springer
16 years 19 days ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
169
Voted
ICML
2000
IEEE
16 years 4 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
CONCURRENCY
2007
75views more  CONCURRENCY 2007»
15 years 3 months ago
A distributed packed storage for large dense parallel in-core calculations
We propose in this paper a distributed packed storage format that exploits the symmetry or the triangular structure of a dense matrix. This format stores only half of the matrix w...
Marc Baboulin, Luc Giraud, Serge Gratton, Julien L...
139
Voted
IPPS
2007
IEEE
15 years 10 months ago
Java and asynchronous iterative applications: large scale experiments
This paper focuses on large scale experiments with Java and asynchronous iterative applications. In those applications, tasks are dependent and the use of distant clusters may be ...
Jacques M. Bahi, Raphaël Couturier, David Lai...
157
Voted
RECOMB
2008
Springer
16 years 4 months ago
A Fast, Alignment-Free, Conservation-Based Method for Transcription Factor Binding Site Discovery
As an increasing number of eukaryotic genomes are being sequenced, comparative studies aimed at detecting regulatory elements in intergenic sequences are becoming more prevalent. M...
Raluca Gordân, Leelavati Narlikar, Alexander...