Sciweavers

1333 search results - page 68 / 267
» Not a Number of Floating Point Problems
Sort
View
137
Voted
SDM
2009
SIAM
117views Data Mining» more  SDM 2009»
16 years 22 days ago
Spatially Cost-Sensitive Active Learning.
In active learning, one attempts to maximize classifier performance for a given number of labeled training points by allowing the active learning algorithm to choose which points...
Alexander Liu, Goo Jun, Joydeep Ghosh
153
Voted
CVPR
2006
IEEE
16 years 5 months ago
Structure from Motion with Known Camera Positions
The wide availability of GPS sensors is changing the landscape in the applications of structure from motion techniques for localization. In this paper, we study the problem of est...
Rodrigo L. Carceroni, Ankita Kumar, Kostas Daniili...
124
Voted
GD
2006
Springer
15 years 7 months ago
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
Rolf Klein, Martin Kutz
114
Voted
AB
2007
Springer
15 years 7 months ago
Reduction of Algebraic Parametric Systems by Rectification of Their Affine Expanded Lie Symmetries
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
Alexandre Sedoglavic
COLT
2010
Springer
15 years 1 months ago
Principal Component Analysis with Contaminated Data: The High Dimensional Case
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
Huan Xu, Constantine Caramanis, Shie Mannor