21108 search results - page 269 / 4222 » A General Class of Models of |
215
click to vote
PODS
1994
ACM
15 years 10 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
145
click to vote
AUSDM
2006
Springer
15 years 10 months ago
2006
Springer
During knowledge acquisition multiple alternative potential rules all appear equally credible. This paper addresses the dearth of formal analysis about how to select between such a...
153
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
144
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We consider generalized noncooperative Nash games with “shared constraints” in which there is a common constraint that players’ strategies are required to satisfy. We add...
175
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...