845 search results - page 54 / 169 » Complexity Dimensions and Learnability |
104
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
111
Voted
VLSISP
2008
15 years 17 days ago
2008
Data dominated signal processing applications are typically described using large and multi-dimensional arrays and loop nests. The order of production and consumption of array ele...
96
Voted
VL
1993
IEEE
15 years 4 months ago
1993
IEEE
This paper describes fractal approaches to the problems which associate with visualizing huge hierarchies. The geometrical characteristic of a fractal, selfsimilarity, allows user...
99
Voted
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
84
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...