Sciweavers

481 search results - page 6 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
COR
2008
175views more  COR 2008»
13 years 8 months ago
Lower and upper bounds for a two-level hierarchical location problem in computer networks
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
Aníbal Alberto Vilcapoma Ignacio, Virg&iacu...
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
14 years 25 days ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski
JC
2007
130views more  JC 2007»
13 years 8 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
13 years 8 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
STACS
2009
Springer
14 years 1 months ago
Lower Bounds for Multi-Pass Processing of Multiple Data Streams
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...
Nicole Schweikardt