Sciweavers

5210 search results - page 239 / 1042
» Exact geometric computation
Sort
View
NECO
2008
112views more  NECO 2008»
15 years 6 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
137
Voted
CORR
2010
Springer
70views Education» more  CORR 2010»
15 years 4 months ago
A Generalized Coupon Collector Problem
This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets d coupons each run and he chooses the one that he has the least ...
Weiyu Xu, Ao Kevin Tang
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
16 years 21 days ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
CVPR
2007
IEEE
16 years 8 months ago
Flexible Object Models for Category-Level 3D Object Recognition
Today's category-level object recognition systems largely focus on fronto-parallel views of objects with characteristic texture patterns. To overcome these limitations, we pr...
Akash Kushal, Cordelia Schmid, Jean Ponce
CVPR
2007
IEEE
16 years 8 months ago
Integrating Global and Local Structures: A Least Squares Framework for Dimensionality Reduction
Linear Discriminant Analysis (LDA) is a popular statistical approach for dimensionality reduction. LDA captures the global geometric structure of the data by simultaneously maximi...
Jianhui Chen, Jieping Ye, Qi Li