Sciweavers

1274 search results - page 121 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
97
Voted
FOCM
2007
76views more  FOCM 2007»
14 years 10 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale
102
Voted
COMPGEOM
2008
ACM
15 years 1 days ago
Polychromatic colorings of plane graphs
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
Noga Alon, Robert Berke, Kevin Buchin, Maike Buchi...
85
Voted
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
14 years 10 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...
133
Voted
CVPR
2009
IEEE
16 years 5 months ago
Illumination and Spatially Varying Specular Reflectance from a Single View
Estimating the illumination and the reflectance properties of an object surface from a sparse set of images is an important but inherently ill-posed problem. The problem becomes...
Kenji Hara (Kyushu University), Ko Nishino (Drexel...
81
Voted
CVPR
2004
IEEE
16 years 8 days ago
Shedding Light on Stereoscopic Segmentation
We propose a variational algorithm to jointly estimate the shape, albedo, and light configuration of a Lambertian scene from a collection of images taken from different vantage po...
Hailin Jin, Daniel Cremers, Anthony J. Yezzi, Stef...