1941 search results - page 298 / 389 » On the Hardness of Approximate Reasoning |
204
click to vote
KDD
2003
ACM
16 years 6 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...
154
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
Recently, there has been increasing interest in the issues of cost-sensitive learning and decision making in a variety of applications of data mining. A number of approaches have ...
175
click to vote
KDD
2001
ACM
16 years 6 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...
159
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
172
click to vote
STOC
2006
ACM
16 years 6 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...