4488 search results - page 351 / 898 » Properties of NP-Complete Sets |
216
click to vote
ICML
2004
IEEE
16 years 8 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
199
click to vote
ICML
2004
IEEE
16 years 8 months ago
2004
IEEE
Feature selection is the task of choosing a small set out of a given set of features that capture the relevant properties of the data. In the context of supervised classification ...
215
click to vote
ICML
1998
IEEE
16 years 8 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
185
click to vote
WWW
2005
ACM
16 years 8 months ago
2005
ACM
With the page explosion of WWW, how to cover more useful information with limited storage and computation resources becomes more and more important in web IR research. Using web p...
301
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...