Sciweavers

1298 search results - page 107 / 260
» The online set cover problem
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Online feature selection for pixel classification
Online feature selection (OFS) provides an efficient way to sort through a large space of features, particularly in a scenario where the feature space is large and features take a...
Karen A. Glocer, Damian Eads, James Theiler
IROS
2007
IEEE
149views Robotics» more  IROS 2007»
16 years 23 days ago
A decentralized planner that guarantees the safety of communicating vehicles with complex dynamics that replan online
— This paper considers the problem of coordinating multiple vehicles with kinodynamic constraints that operate in the same partially-known environment. The vehicles are able to c...
Kostas E. Bekris, Konstantinos I. Tsianos, Lydia E...
AAAI
2007
15 years 8 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
TNN
2008
105views more  TNN 2008»
15 years 6 months ago
Incremental Learning of Chunk Data for Online Pattern Classification Systems
This paper presents a pattern classification system in which feature extraction and classifier learning are simultaneously carried out not only online but also in one pass where tr...
Seiichi Ozawa, Shaoning Pang, Nikola K. Kasabov
COMBINATORICS
2004
130views more  COMBINATORICS 2004»
15 years 6 months ago
On-line Ramsey Theory
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Ki...