845 search results - page 15 / 169 » Complexity Dimensions and Learnability |
DCG
2010
13 years 7 months ago
2010
The angle defect, which is the standard way to measure the curvatures at the vertices of polyhedral surfaces, goes back at least as far as Descartes. Although the angle defect has ...
CCDS
2010
13 years 4 months ago
2010
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
TIT
2008
13 years 7 months ago
2008
A new wavelet-based methodology for representing data on regular grids is introduced and studied. The main attraction of this new L-CAMP methodology is in the way it scales with th...
COMPGEOM
1994
ACM
13 years 11 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...