1161 search results - page 80 / 233 » Approximation schemes for clustering problems |
100
click to vote
SISAP
2010
IEEE
14 years 10 months ago
2010
IEEE
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
105
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
107
click to vote
SDM
2003
SIAM
15 years 1 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
101
click to vote
ICCCN
2008
IEEE
15 years 6 months ago
2008
IEEE
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
ICML
2009
IEEE
16 years 21 days ago
2009
IEEE
Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, w...