2566 search results - page 107 / 514 » The Online Median Problem |
87
Voted
ICIP
2009
IEEE
16 years 1 months ago
2009
IEEE
Most of the state-of-the-art tracking algorithms are prone to error when dealing with occlusions, especially when the involved moving objects are hardly discernible in appearance....
103
Voted
ACII
2005
Springer
15 years 6 months ago
2005
Springer
In this paper a novel multi-stroke sketch recognition method is presented. This method integrates the stroke segmentation and sketch recognition into a single approach, in which bo...
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
ISHPC
2003
Springer
15 years 6 months ago
2003
Springer
The paper presents the design and development of an online remote trace measurement and analysis system. The work combines the strengths of the TAU performance system with that of ...
102
click to vote
COLT
2006
Springer
15 years 4 months ago
2006
Springer
We address the problem of online de-noising a stream of input points. We assume that the clean data is embedded in a linear subspace. We present two online algorithms for tracking ...