2180 search results - page 119 / 436 » Comparing bio-inspired algorithms in constrained optimizatio... |
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
117
click to vote
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Phoneme segmentation is a fundamental problem in many speech recognition and synthesis studies. Unsupervised phoneme segmentation assumes no knowledge on linguistic contents and a...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Segmentation of medical images is challenging due to poor image contrast and artifacts that result in missing or diffuse organ/tissue boundaries. Consequently, this task involves ...
103
click to vote
IJCAI
2007
14 years 11 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
DOCENG
2006
ACM
15 years 3 months ago
2006
ACM
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...