Sciweavers

2157 search results - page 414 / 432
» Optimal Fast Hashing
Sort
View
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
15 years 4 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
VLDB
2001
ACM
66views Database» more  VLDB 2001»
15 years 4 months ago
An Evaluation of Generic Bulk Loading Techniques
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
Jochen Van den Bercken, Bernhard Seeger
DSN
2000
IEEE
15 years 4 months ago
On the Quality of Service of Failure Detectors
ÐWe study the quality of service (QoS) of failure detectors. By QoS, we mean a specification that quantifies 1) how fast the failure detector detects actual failures and 2) how we...
Wei Chen, Sam Toueg, Marcos Kawazoe Aguilera
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
15 years 4 months ago
Latency-Guided On-Chip Bus Network Design
Abstract— Deep submicron technology scaling has two major ramifications on the design process. First, reduced feature size significantly increases wire delay, thus resulting in...
Milenko Drinic, Darko Kirovski, Seapahn Meguerdich...
ISCA
2000
IEEE
156views Hardware» more  ISCA 2000»
15 years 4 months ago
CHIMAERA: a high-performance architecture with a tightly-coupled reconfigurable functional unit
Reconfigurable hardware has the potential for significant performance improvements by providing support for application−specific operations. We report our experience with Chimae...
Zhi Alex Ye, Andreas Moshovos, Scott Hauck, Prithv...