1974 search results - page 141 / 395 » On Unbiased Linear Approximations |
128
Voted
NIPS
2001
15 years 2 months ago
2001
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
163
Voted
VLSISP
2010
14 years 11 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
128
click to vote
KDD
2008
ACM
16 years 1 months ago
2008
ACM
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
121
click to vote
ALT
2006
Springer
15 years 9 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
103
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...