Sciweavers

2994 search results - page 272 / 599
» Time sequences
Sort
View
FCT
2005
Springer
15 years 10 months ago
A Faster and Simpler 2-Approximation Algorithm for Block Sorting
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...
Wolfgang W. Bein, Lawrence L. Larmore, Linda Moral...
146
Voted
ICIAR
2007
Springer
15 years 6 months ago
A Simple Oriented Mean-Shift Algorithm for Tracking
Mean-Shift tracking gained a lot of popularity in computer vision community. This is due to its simplicity and robustness. However, the original formulation does not estimate the o...
Jamil Draréni, Sébastien Roy
ICIP
2009
IEEE
16 years 5 months ago
Fast And Robust Dominant Points Detection On Digital Curves
A new and fast method for dominant point detection and polygonal representation of a discrete curve is proposed. Starting from results of discrete geometry [1, 2], the notion of m...
MVA
2011
396views Computer Vision» more  MVA 2011»
14 years 11 months ago
Real-time vehicle tracking for driving assistance
Detecting car taillights at night is a task which can nowadays be accomplished very fast on cheap hardware. We rely on such detections to build a vision-based system that, couplin...
Andrea Fossati, Patrick Schönmann, Pascal Fua
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
15 years 5 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...