Sciweavers

3088 search results - page 274 / 618
» Online Passive-Aggressive Algorithms
Sort
View
ICRA
2008
IEEE
229views Robotics» more  ICRA 2008»
16 years 1 months ago
Learning of moving cast shadows for dynamic environments
Abstract— We propose a novel online framework for detecting moving shadows in video sequences using statistical learning techniques. In this framework, Support Vector Machines ar...
Ajay J. Joshi, Nikolaos Papanikolopoulos
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 8 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
SIROCCO
2007
15 years 8 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...
157
Voted
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
15 years 10 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
IPL
2007
79views more  IPL 2007»
15 years 6 months ago
Uniform metrical task systems with a limited number of states
We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where H...
Wolfgang W. Bein, Lawrence L. Larmore, John Noga