Sciweavers

315 search results - page 11 / 63
» Cell-probe lower bounds for the partial match problem
Sort
View
92
Voted
RECOMB
2005
Springer
15 years 10 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
DAWAK
2011
Springer
13 years 9 months ago
An Envelope-Based Approach to Rotation-Invariant Boundary Image Matching
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...
Sang-Pil Kim, Yang-Sae Moon, Sun-Kyong Hong
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
15 years 10 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
AAAI
1997
14 years 11 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
14 years 11 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos