21 search results - page 3 / 5 » Complexity of Approximating Closest Substring Problems |
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
159
Voted
STOC
1999
ACM
15 years 5 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
102
Voted
VMCAI
2005
Springer
15 years 6 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
124
Voted
CPM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
180
click to vote
JPDC
2007
15 years 1 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...