1040 search results - page 184 / 208 » Rounding algorithms for covering problems |
PRICAI
2010
Springer
14 years 7 months ago
2010
Springer
Unlike traditional classification tasks, multilabel classification allows a sample to associate with more than one label. This generalization naturally arises the difficulty in cla...
115
click to vote
PODC
2006
ACM
15 years 3 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
MOBICOM
2006
ACM
15 years 3 months ago
2006
ACM
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
70
Voted
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
WPES
2003
ACM
15 years 2 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...