516 search results - page 44 / 104 » Generalizing the Discrete Timed Automaton |
123
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
163
click to vote
CPM
1998
Springer
15 years 5 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
158
click to vote
STOC
2012
ACM
13 years 4 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
135
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
102
click to vote
WSC
2004
15 years 2 months ago
2004
HDPS is a practical system for designing modeling paradigms, creating hierarchal model definitions, and evaluating multi-paradigm models - particularly in business and finance. HD...