Sciweavers

1813 search results - page 200 / 363
» Calculi of Approximation Spaces
Sort
View
ECCV
2010
Springer
15 years 9 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
ICPR
2010
IEEE
15 years 9 months ago
Large Margin Classifier Based on Affine Hulls
This paper introduces a geometrically inspired large-margin classifier that can be a better alternative to the Support Vector Machines (SVMs) for the classification problems with ...
Hakan Cevikalp, Hasan Serhan Yavuz
CGI
1999
IEEE
15 years 9 months ago
Volume Decimation of Irregular Tetrahedral Grids
Rendering highly complex models can be time and space prohibitive, and decimation is an important tool in providing simplifications. A decimated model may replace the original ent...
Allen Van Gelder, Vivek Verma, Jane Wilhelms
COLT
1999
Springer
15 years 9 months ago
Covering Numbers for Support Vector Machines
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
Ying Guo, Peter L. Bartlett, John Shawe-Taylor, Ro...
SI3D
1997
ACM
15 years 9 months ago
Model Simplification Using Vertex-Clustering
This paper presents a practical technique to automatically compute approximations of polygonal representations of 3D objects. It is based on a previously developed model simplific...
Kok-Lim Low, Tiow Seng Tan