Sciweavers

298 search results - page 15 / 60
» Measuring Linearity of Ordered Point Sets
Sort
View
FOCS
2004
IEEE
15 years 1 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
MCS
2010
Springer
14 years 7 months ago
Resolution-stationary random number generators
Besides speed and period length, the quality of uniform random number generators is usually assessed by measuring the uniformity of their point sets, formed by taking vectors of s...
François Panneton, Pierre L'Ecuyer
74
Voted
IJCV
2006
142views more  IJCV 2006»
14 years 9 months ago
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
Helmut Pottmann, Qi-Xing Huang, Yong-Liang Yang, S...
NIPS
2000
14 years 10 months ago
Active Support Vector Machine Classification
An active set strategy is applied to the dual of a simple reformulation of the standard quadratic program of a linear support vector machine. This application generates a fast new...
Olvi L. Mangasarian, David R. Musicant
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
14 years 10 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta