Sciweavers

7150 search results - page 235 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
JSA
2008
124views more  JSA 2008»
15 years 6 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
198
Voted
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 10 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
ESA
2009
Springer
156views Algorithms» more  ESA 2009»
16 years 1 months ago
On Revenue Maximization in Second-Price Ad Auctions
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
16 years 8 months ago
Adaptive Approximate Similarity Searching through Metric Social Networks
Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between...
Jan Sedmidubský, Pavel Zezula, Stanislav Ba...
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
16 years 21 days ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari