1813 search results - page 303 / 363 » Instance Pruning Techniques |
AI
1999
Springer
14 years 9 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
MCS
2002
Springer
14 years 9 months ago
2002
Springer
In classifier combining, one tries to fuse the information that is given by a set of base classifiers. In such a process, one of the difficulties is how to deal with the variabilit...
NRHM
1998
14 years 9 months ago
1998
: Due to the tremendously increasing popularity of the World-Wide Web, hypermedia is going to be the leading online information medium for some years to come and will most likely b...
111
click to vote
SIAMCOMP
1998
14 years 9 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...