134 search results - page 7 / 27 » On the Complexity of Approximating the VC Dimension |
DCG
2010
14 years 6 months ago
2010
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
80
Voted
VC
2008
14 years 9 months ago
2008
Photorealistic rendering is one of the oldest and most important research areas in computer graphics. More recently, the concept of nonphotorealistic rendering has been proposed as...
APPML
2007
14 years 9 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
104
click to vote
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
TSP
2010
14 years 4 months ago
2010
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...