817 search results - page 3 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
141
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
99
Voted
DGCI
2005
Springer
15 years 10 months ago
2005
Springer
128
Voted
FOCS
1995
IEEE
15 years 8 months ago
1995
IEEE
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
137
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
241
click to vote
AAAI
2010
15 years 6 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...