7006 search results - page 1325 / 1402 » Approximation Algorithms |
109
click to vote
KDD
2007
ACM
16 years 1 months ago
2007
ACM
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
141
Voted
KDD
2003
ACM
16 years 1 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
115
click to vote
KDD
2001
ACM
16 years 1 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
127
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
115
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...