Sciweavers

2157 search results - page 30 / 432
» Optimal Fast Hashing
Sort
View
IPPS
2003
IEEE
15 years 8 months ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner
CCCG
2010
15 years 4 months ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
15 years 4 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 11 days ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat
TIT
2010
103views Education» more  TIT 2010»
14 years 9 months ago
Fast optimal decoding of multiplexed orthogonal designs by conditional optimization
This paper focuses on conditional optimization as a decoding primitive for high rate space
Songsri Sirianunpiboon, Yiyue Wu, A. Robert Calder...