Sciweavers

16666 search results - page 321 / 3334
» Descriptive and Computational Complexity
Sort
View
CGF
1998
134views more  CGF 1998»
15 years 6 months ago
Progressive Iso-Surface Extraction from Hierarchical 3D Meshes
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
Wenli Cai, Georgios Sakas, Roberto Grosso, Thomas ...
JMLR
2002
106views more  JMLR 2002»
15 years 6 months ago
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
Prasanth B. Nair, Arindam Choudhury 0002, Andy J. ...
ATAL
2008
Springer
15 years 8 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
ICAS
2008
IEEE
190views Robotics» more  ICAS 2008»
16 years 1 months ago
A Survey of Context Adaptation in Autonomic Computing
—Autonomic Computing (AC) is an emerging paradigm aiming at simplifying the administration of complex computer systems. Efforts required to deploy and maintain complex systems ar...
Cornel Klein, Reiner N. Schmid, Christian Leuxner,...
170
Voted
MFCS
2009
Springer
15 years 11 months ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...