Sciweavers

1518 search results - page 57 / 304
» Exact and Approximate Bandwidth
Sort
View
SISAP
2008
IEEE
166views Data Mining» more  SISAP 2008»
15 years 4 months ago
Approximate Similarity Search in Genomic Sequence Databases Using Landmark-Guided Embedding
Similarity search in sequence databases is of paramount importance in bioinformatics research. As the size of the genomic databases increases, similarity search of proteins in the...
Ahmet Sacan, Ismail Hakki Toroslu
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
15 years 3 months ago
The Complexity of Making Unique Choices: Approximating 1-in- k SAT
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
Venkatesan Guruswami, Luca Trevisan
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 3 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
14 years 11 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
CGF
2005
138views more  CGF 2005»
14 years 9 months ago
Approximation of a Variable Density Cloud of Points by Shrinking a Discrete Membrane
This paper describes a method to obtain a closed surface that approximates a general 3D data point set with non-uniform density. Aside from the positions of the initial data point...
Jordi Esteve, Pere Brunet, Alvar Vinacua