Sciweavers

1998 search results - page 400 / 400
» Complexity of the Cover Polynomial
Sort
View
NAR
2006
85views more  NAR 2006»
13 years 6 months ago
WormBase: better software, richer content
WormBase (http://wormbase.org), the public database for genomics and biology of Caenorhabditis elegans, has been restructured for stronger performance and expanded for richer biol...
Erich M. Schwarz, Igor Antoshechkin, Carol Bastian...
PODC
2009
ACM
14 years 6 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
13 years 11 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler