564 search results - page 63 / 113 » Linear Time Algorithms for Exact Distance Transform |
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
COCOON
1997
Springer
14 years 2 months ago
1997
Springer
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
ICDAR
2005
IEEE
14 years 3 months ago
2005
IEEE
Page segmentation algorithms found in published literatures often rely on some predetermined parameters such as general font sizes, distances between text lines and document scan ...
SIGOPS
2008
13 years 10 months ago
2008
CUBIC is a congestion control protocol for TCP (transmission control protocol) and the current default TCP algorithm in Linux. The protocol modifies the linear window growth funct...
MIR
2006
ACM
14 years 4 months ago
2006
ACM
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multimedia databases, an exact search is not meaningful. Thus, mu...