Sciweavers

134 search results - page 9 / 27
» On the Complexity of Approximating the VC Dimension
Sort
View
81
Voted
TSP
2008
140views more  TSP 2008»
14 years 9 months ago
On the Dual-Tree Complex Wavelet Packet and M-Band Transforms
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...
I. Bayram, Ivan W. Selesnick
UAI
1996
14 years 10 months ago
Asymptotic Model Selection for Directed Networks with Hidden Variables
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
Dan Geiger, David Heckerman, Christopher Meek
SIGGRAPH
1997
ACM
15 years 1 months ago
Progressive simplicial complexes
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
Jovan Popovic, Hugues Hoppe
ESA
2007
Springer
150views Algorithms» more  ESA 2007»
15 years 3 months ago
On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose...
Amos Israeli, Dror Rawitz, Oran Sharon
COMPGEOM
2010
ACM
15 years 1 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh