Sciweavers

5973 search results - page 418 / 1195
» Fundamental forms of information
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 8 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
RECOMB
2009
Springer
16 years 8 months ago
Storage and Retrieval of Individual Genomes
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
Gonzalo Navarro, Jouni Sirén, Niko Väl...
CHI
2009
ACM
16 years 8 months ago
Programming reality: from transitive materials to organic user interfaces
Over the past few years, a quiet revolution has been redefining our fundamental computing technologies. Flexible E-Ink, OLED displays, shape-changing materials, parametric design,...
Marcelo Coelho, Ivan Poupyrev, Sajid Sadi, Roel Ve...
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 7 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
EUROSYS
2007
ACM
16 years 4 months ago
Latency and bandwidth-minimizing failure detectors
Failure detectors are fundamental building blocks in distributed systems. Multi-node failure detectors, where the detector is tasked with monitoring N other nodes, play a critical...
Kelvin C. W. So, Emin Gün Sirer