Sciweavers

83 search results - page 17 / 17
» The cover time of the giant component of a random graph
Sort
View
PVLDB
2008
163views more  PVLDB 2008»
13 years 4 months ago
C-DEM: a multi-modal query system for Drosophila Embryo databases
The amount of biological data publicly available has experienced an exponential growth as the technology advances. Online databases are now playing an important role as informatio...
Fan Guo, Lei Li, Christos Faloutsos, Eric P. Xing
TSP
2010
12 years 12 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 5 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami