Sciweavers

7006 search results - page 376 / 1402
» Approximation Algorithms
Sort
View
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
15 years 8 months ago
The Sketching Complexity of Pattern Matching
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
15 years 11 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
JCB
2007
168views more  JCB 2007»
15 years 4 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
ESWS
2009
Springer
15 years 11 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
MP
2006
119views more  MP 2006»
15 years 4 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey