Sciweavers

373 search results - page 27 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 8 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
14 years 1 months ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
ICCV
2009
IEEE
13 years 5 months ago
Component analysis approach to estimation of tissue intensity distributions of 3D images
Many segmentation problems in medical imaging rely on accurate modeling and estimation of tissue intensity probability density functions. Gaussian mixture modeling, currently the ...
Arridhana Ciptadi, Cheng Chen, Vitali Zagorodnov
CVPR
2010
IEEE
13 years 8 months ago
A probabilistic framework for joint segmentation and tracking
Most tracking algorithms implicitly apply a coarse segmentation of each target object using a simple mask such as a rectangle or an ellipse. Although convenient, such coarse segme...
Chad Aeschliman, Johnny Park, Avinash C. Kak