Sciweavers

134 search results - page 2 / 27
» On the Complexity of Approximating the VC Dimension
Sort
View
CORR
2000
Springer
134views Education» more  CORR 2000»
13 years 4 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
COLT
2000
Springer
13 years 8 months ago
The Role of Critical Sets in Vapnik-Chervonenkis Theory
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
Nicolas Vayatis
VC
2010
134views more  VC 2010»
13 years 3 months ago
Detail-driven digital hologram generation
Abstract Digital holography is a technology with a potential to provide realistic 3D images. However, generation of digital holograms is a computationally demanding task. Thus, the...
Ivo Hanák, Martin Janda, Václav Skal...
VC
2008
93views more  VC 2008»
13 years 4 months ago
Real-time editing and relighting of homogeneous translucent materials
Existing techniques for fast, high-quality rendering of translucent materials often fix BSSRDF parameters at precomputation time. We present a novel method for accurate rendering a...
Rui Wang 0004, Ewen Cheslack-Postava, Rui Wang 000...
VC
2010
143views more  VC 2010»
12 years 11 months ago
A PDE method for patchwise approximation of large polygon meshes
Abstract Three-dimensional (3D) representations of complex geometric shapes, especially when they are reconstructed from magnetic resonance imaging (MRI) and computed tomography (C...
Yun Sheng, Alexei Sourin, Gabriela González...