Sciweavers

2661 search results - page 470 / 533
» Quantum Complexity Classes
Sort
View
VVS
1998
IEEE
126views Visualization» more  VVS 1998»
15 years 5 months ago
Semi-Automatic Generation of Transfer Functions for Direct Volume Rendering
Although direct volume rendering is a powerful tool for visualizing complex structures within volume data, the size and complexity of the parameter space controlling the rendering...
Gordon L. Kindlmann, James W. Durkin
116
Voted
SIGGRAPH
1998
ACM
15 years 5 months ago
Subdivision Surfaces in Character Animation
The creation of believable and endearing characters in computer graphics presents a number of technical challenges, including the modeling, animation and rendering of complex shap...
Tony DeRose, Michael Kass, Tien Truong
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 4 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
107
Voted
IPSN
2010
Springer
15 years 4 months ago
Practical modeling and prediction of radio coverage of indoor sensor networks
The robust operation of many sensor network applications depends on deploying relays to ensure wireless coverage. Radio mapping aims to predict network coverage based on a small n...
Octav Chipara, Gregory Hackmann, Chenyang Lu, Will...
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 4 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...