Sciweavers

10988 search results - page 156 / 2198
» Algorithmic Folding Complexity
Sort
View
MIA
2010
104views more  MIA 2010»
14 years 10 months ago
Combining atlas based segmentation and intensity classification with nearest neighbor transform and accuracy weighted vote
In this paper, different methods to improve atlas based segmentation are presented. The first technique is a new mapping of the labels of an atlas consistent with a given intensit...
Michaël Sdika
150
Voted
ICCV
2011
IEEE
14 years 3 months ago
A 3D Laplacian-Driven Parametric Deformable Model
3D parametric deformable models have been used to extract volumetric object boundaries and they generate smooth boundary surfaces as results. However, in some segmentation cases, ...
Tian Shen, Xiaolei Huang, Hongsheng Li, Edward Kim...
ATAL
2009
Springer
15 years 10 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
FOCS
2006
IEEE
15 years 9 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
140
Voted
TSP
2008
118views more  TSP 2008»
15 years 3 months ago
Analytical Rate-Distortion-Complexity Modeling of Wavelet-Based Video Coders
Analytical modeling of the performance of video coders is essential in a variety of applications, such as power-constrained processing, complexity-driven video streaming, etc., whe...
Brian Foo, Yiannis Andreopoulos, Mihaela van der S...