9176 search results - page 132 / 1836 » algorithms 2010 |
135
click to vote
JSC
2010
15 years 3 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
140
click to vote
PAMI
2010
15 years 2 months ago
2010
— This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational require...
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The median problem in the weighted Jaccard metric was
164
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
124
Voted
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...