2740 search results - page 74 / 548 » Approximating Component Selection |
99
Voted
RSFDGRC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present a study on a rough set based approach for feature selection. Instead of using significance or support, Parameterized Average Support Heuristic (PASH) consider...
81
Voted
SIGMOD
1994
ACM
15 years 4 months ago
1994
ACM
In this paper, we propose a novel approach for estimating the record selectivities of database queries. The real attribute value distribution is adaptively approximated by a curve...
101
Voted
ESANN
2001
15 years 1 months ago
2001
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
100
Voted
WSC
2000
15 years 1 months ago
2000
Recent breakthroughs in communication and software engineering has resulted in significant growth of web-based computing. Web-based techniques have been employed for modeling, sim...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...