Sciweavers

152 search results - page 24 / 31
» Robust Polynomials and Quantum Algorithms
Sort
View
SMI
1999
IEEE
116views Image Analysis» more  SMI 1999»
14 years 22 days ago
Intersecting Surfaces of Special Types
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of cir...
Myung-Soo Kim
ORL
2008
99views more  ORL 2008»
13 years 8 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
ICCV
2007
IEEE
14 years 10 days ago
Efficient Generic Calibration Method for General Cameras with Single Centre of Projection
Generic camera calibration is a non-parametric calibration technique that is applicable to any type of vision sensor. However, the standard generic calibration method was develope...
Aubrey K. Dunne, John Mallon, Paul F. Whelan
TSP
2010
13 years 3 months ago
Sampling piecewise sinusoidal signals with finite rate of innovation methods
We consider the problem of sampling piecewise sinusoidal signals. Classical sampling theory does not enable perfect reconstruction of such signals since they are not bandlimited. ...
Jesse Berent, Pier Luigi Dragotti, Thierry Blu
FOCS
2008
IEEE
14 years 2 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...