Sciweavers

128 search results - page 3 / 26
» Lower bounds for adaptive collect and related objects
Sort
View
RECOMB
2005
Springer
14 years 7 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
ICALP
2011
Springer
12 years 11 months ago
Content Search through Comparisons
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
Amin Karbasi, Stratis Ioannidis, Laurent Massouli&...
CPAIOR
2007
Springer
14 years 1 months ago
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
J. M. van den Akker, Guido Diepen, J. A. Hoogeveen
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
13 years 11 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 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