Sciweavers

2566 search results - page 99 / 514
» The Online Median Problem
Sort
View
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
15 years 5 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
101
Voted
CDC
2009
IEEE
119views Control Systems» more  CDC 2009»
15 years 5 months ago
On-line adaptive optimal timing control of switched systems
Abstract— In this paper we consider the problem of optimizing over the switching times for a multi-modal dynamic system when the complete cost-to-go is not available. The instant...
Xu Chu Ding, Yorai Wardi, Magnus Egerstedt
87
Voted
ICALP
1999
Springer
15 years 5 months ago
Online Data Structures in External Memory
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
Jeffrey Scott Vitter
IBPRIA
2007
Springer
15 years 4 months ago
On-Line Classification of Human Activities
In this paper we address the problem of on-line recognition of human activities taking place in a public area such as a shopping center. We consider standard activities; namely, en...
Jacinto C. Nascimento, Mário A. T. Figueire...
129
Voted
COLT
2005
Springer
15 years 2 months ago
Loss Bounds for Online Category Ranking
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
Koby Crammer, Yoram Singer