Sciweavers

914 search results - page 131 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
DAGM
2010
Springer
13 years 5 months ago
A Model-Based Approach to the Segmentation of Nasal Cavity and Paranasal Sinus Boundaries
We present a model-driven approach to the segmentation of nasal cavity and paranasal sinus boundaries. Based on computed tomography data of a patients head, our approach aims to ex...
Carsten Last, Simon Winkelbach, Friedrich M. Wahl,...
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 3 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
3DPVT
2006
IEEE
186views Visualization» more  3DPVT 2006»
14 years 3 months ago
Range Image Registration Based on Circular Features
Range sensing technology allows the photo-realistic modeling of large-scale scenes, such as urban structures. A major bottleneck in the process of 3D scene acquisition is the auto...
Cecilia Chao Chen, Ioannis Stamos
CVGIP
2007
88views more  CVGIP 2007»
13 years 9 months ago
Autonomous pedestrians
We address the difficult open problem of emulating the rich complexity of real pedestrians in urban environments. Our artificial life approach integrates motor, perceptual, beha...
Wei Shao, Demetri Terzopoulos
AI
1999
Springer
13 years 8 months ago
Emergent Cooperative Goal-Satisfaction in Large Scale Automated-Agent Systems
Cooperation among autonomous agents has been discussed in the DAI community for several years. Papers about cooperation 6,45 , negotiation 33 , distributed planning 5 , and coalit...
Onn Shehory, Sarit Kraus, Osher Yadgar