995 search results - page 101 / 199 » Learning Useful Horn Approximations |
100
Voted
ESANN
2003
15 years 2 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
118
Voted
SIAMJO
2010
14 years 7 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
109
click to vote
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
110
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
129
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...