766 search results - page 46 / 154 » Online Variance Minimization |
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
—This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. We apply three rou...
DAGSTUHL
2006
15 years 1 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
102
click to vote
ALGORITHMICA
2010
14 years 12 months ago
2010
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
141
click to vote
CRV
2011
IEEE
13 years 11 months ago
2011
IEEE
Abstract—The idea of an online visual vocabulary is proposed. In contrast to the accepted strategy of generating vocabularies offline, using the k-means clustering over all the ...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...