Sciweavers

7129 search results - page 874 / 1426
» Approximation Algorithms for Treewidth
Sort
View
KI
2007
Springer
15 years 5 months ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
Emmanuel Benazera
CAGD
2000
62views more  CAGD 2000»
15 years 4 months ago
Volume morphing and rendering - An integrated approach
In this paper, we first introduce a 3D morphing method for landmark-based volume deformation, using various scattered data interpolation schemes. Qualitative and speed comparisons...
Shiaofen Fang, Rajagopalan Srinivasan, Raghu Ragha...
140
Voted
CG
2002
Springer
15 years 4 months ago
BRDC: binary representation of displacement code for line
: In raster graphics, a line is displayed as a sequence of connected pixels that best approximate the line with minimum deviation. The displacement code of a line is a sequence of ...
Lanfang Miao, Xinguo Liu, Qunsheng Peng, Hujun Bao
MOC
2000
126views more  MOC 2000»
15 years 4 months ago
Adaptive multilevel methods in space and time for parabolic problems-the periodic case
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
J. B. Burie, M. Marion
119
Voted
PR
2000
130views more  PR 2000»
15 years 4 months ago
Self-annealing and self-annihilation: unifying deterministic annealing and relaxation labeling
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
Anand Rangarajan