371 search results - page 36 / 75 » Computation of the Minimal Associated Primes |
COLING
2000
13 years 9 months ago
2000
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
288
click to vote
Tutorial
Correlation based matching typically produces dense depth maps by calculating the disparity at each pixel within a neighborhood. This is achieved by taking a square window of certa...
CAGD
2005
13 years 7 months ago
2005
We propose a flexible and efficient wavelet construction for non-uniform B-spline curves and surfaces. The method allows to remove knots in arbitrary order minimizing the displace...
JUCS
2007
13 years 7 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
MOC
2002
13 years 7 months ago
2002
Abstract. We analyze the approximation and smoothness properties of quincunx fundamental refinable functions. In particular, we provide a general way for the construction of quincu...