271 search results - page 16 / 55 » On the Online Unit Clustering Problem |
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
—Wireless communications using ad hoc networks are receiving an increasing interest. The most attractive feature of ad hoc networks is the flexibility. The network is set up by ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper, we present a novel on-line probabilistic generative model that simultaneously deals with both the clustering and the tracking of an unknown number of moving objects...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
WEBI
2009
Springer
14 years 2 months ago
2009
Springer
We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we pres...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...