567 search results - page 89 / 114 » On the complexity of constrained VC-classes |
CG
2006
Springer
13 years 8 months ago
2006
Springer
In most previous NPR line rendering systems, geometric properties have been directly used to extract and stylize certain edges. However, this approach is bound to a tight stylizat...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract -We investigate the achievable rate of data transmission from sources to sinks through a multiple-relay network. We study achievable rates for omniscient coding, in which ...
COR
2007
13 years 8 months ago
2007
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...