5595 search results - page 1074 / 1119 » Approximation Algorithms for Clustering Problems |
155
Voted
ASIAMS
2007
IEEE
15 years 9 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
126
click to vote
ALT
2007
Springer
15 years 8 months ago
2007
Springer
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
128
Voted
STOC
1993
ACM
15 years 6 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
119
Voted
COMPGEOM
2007
ACM
15 years 6 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
102
Voted
BMCBI
2008
15 years 2 months ago
2008
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...