Sciweavers

16404 search results - page 2896 / 3281
» A set coverage problem
Sort
View
ASPLOS
2009
ACM
16 years 7 months ago
ASSURE: automatic software self-healing using rescue points
Software failures in server applications are a significant problem for preserving system availability. We present ASSURE, a system that introduces rescue points that recover softw...
Stelios Sidiroglou, Oren Laadan, Carlos Perez, Nic...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 7 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 7 months ago
Spatial Clustering of Multivariate Genomic and Epigenomic Information
The combination of fully sequence genomes and new technologies for high density arrays and ultra-rapid sequencing enables the mapping of generegulatory and epigenetics marks on a g...
Rami Jaschek, Amos Tanay
PPOPP
2009
ACM
16 years 7 months ago
Idempotent work stealing
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
Maged M. Michael, Martin T. Vechev, Vijay A. Saras...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 7 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera
« Prev « First page 2896 / 3281 Last » Next »