2376 search results - page 236 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
WSC
2000
13 years 9 months ago
2000
This paper presents a logistic algorithm that improves traffic conditions in a network-like automated material handling system (AMHS). The algorithm uses a lookahead procedure and...
JACM
2006
13 years 8 months ago
2006
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
BMCBI
2011
12 years 11 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
CVIU
2004
13 years 8 months ago
2004
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
JAL
2006
13 years 8 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...