2957 search results - page 387 / 592 » The Complexity of Polynomial-Time Approximation |
196
click to vote
CGF
1998
15 years 6 months ago
1998
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
181
click to vote
IPM
2002
15 years 6 months ago
2002
Although a substantial number of research projects have addressed music information retrieval over the past three decades, the field is still very immature. Few of these projects ...
203
click to vote
GRAMMARS
1998
15 years 6 months ago
1998
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
133
click to vote
TMI
2002
15 years 6 months ago
2002
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
196
click to vote
QUESTA
2007
15 years 6 months ago
2007
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...