142 search results - page 22 / 29 » Computing Maximum-Scoring Segments in Almost Linear Time |
SMA
2003
ACM
14 years 20 days ago
2003
ACM
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Mean shift is an iterative mode-seeking algorithm widely used in pattern recognition and computer vision. However, its convergence is sometimes too slow to be practical. In this pa...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
BC
2000
13 years 7 months ago
2000
The gait transition in legged animals has attracted many researchers, and its relation to metabolic cost and mechanical work has been discussed in recent decades. We assumed that t...