817 search results - page 101 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
ICCV
1999
IEEE
14 years 8 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
LWA
2007
13 years 9 months ago
2007
This paper describes the application of machine learning methods to determine parameters for DeLite, a readability checking tool. DeLite pinpoints text segments that are difficul...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
JAIR
2008
13 years 7 months ago
2008
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Due to the complexity of the problem, the majority of the previo...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...