Sciweavers

1100 search results - page 26 / 220
» Approximate distance oracles
Sort
View
SPIRE
2000
Springer
14 years 1 days ago
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays
We consider the problem of defining and evaluating the distance between three
Kimmo Fredriksson, Esko Ukkonen
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 9 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
13 years 6 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen
CORR
2008
Springer
119views Education» more  CORR 2008»
13 years 8 months ago
On the Relationship between Transmission Power and Capacity of an Underwater Acoustic Communication Channel
The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. As a consequence, transmission...
Daniel Enrique Lucani, Milica Stojanovic, Muriel M...
FOCS
2009
IEEE
14 years 3 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák