Sciweavers

536 search results - page 41 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
JC
2006
68views more  JC 2006»
13 years 8 months ago
Monte Carlo approximation of weakly singular integral operators
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
Stefan Heinrich
FSTTCS
2004
Springer
14 years 1 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
NIPS
2000
13 years 9 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 8 months ago
Polygon Exploration with Discrete Vision
With the advent of autonomous robots with two- and three-dimensional scanning capabilities, classical visibility-based exploration methods from computational geometry have gained ...
Sándor P. Fekete, Christiane Schmidt
CVPR
2011
IEEE
13 years 3 months ago
Supervised Local Subspace Learning for Continuous Head Pose Estimation
Head pose estimation from images has recently attracted much attention in computer vision due to its diverse applications in face recognition, driver monitoring and human computer...
Dong Huang, Markus Storer, Fernando DelaTorre, Hor...