Sciweavers

3319 search results - page 478 / 664
» Type Theoretical Databases
Sort
View
IPPS
2005
IEEE
15 years 10 months ago
Using Leader-Based Communication to Improve the Scalability of Single-Round Group Membership Algorithms
Sigma, the first single-round group membership (GM) algorithm, was recently introduced and demonstrated to operate consistently with theoretical expectations in a simulated WAN en...
Roger Khazan, Sophia Yuditskaya
SWSTE
2005
IEEE
15 years 10 months ago
Mapping Structures for Flash Memories: Techniques and Open Problems
Flash memory is a type of electrically erasable programmable read-only memory (EEPROM). Because flash memories are nonvolatile and relatively dense, they are now used to store ...
Eran Gal, Sivan Toledo
CONCUR
2005
Springer
15 years 10 months ago
Games Where You Can Play Optimally Without Any Memory
Abstract. Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, t...
Hugo Gimbert, Wieslaw Zielonka
DNA
2005
Springer
113views Bioinformatics» more  DNA 2005»
15 years 10 months ago
A Self-assembly Model of Time-Dependent Glue Strength
Abstract Self-assembly is a ubiquitous process in which small objects selforganize into larger and complex structures. In 2000, Rothemund and Winfree proposed a Tile Assembly Model...
Sudheer Sahu, Peng Yin, John H. Reif
ICALP
2005
Springer
15 years 10 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...