Sciweavers

89 search results - page 13 / 18
» Robust solutions for combinatorial auctions
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Shape Regularized Active Contour Using Iterative Global Search and Local Optimization
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
Tianli Yu, Jiebo Luo, Narendra Ahuja
CEC
2007
IEEE
14 years 1 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
CDC
2010
IEEE
133views Control Systems» more  CDC 2010»
13 years 2 months ago
Decentralized task assignment in camera networks
The problem of task assignment naturally arises in multiagent multitask systems, where an optimal matching of agents and tasks is sought. This problem is a combinatorial optimizati...
Angelo Cenedese, Federico Cerruti, Mirko Fabbro, C...
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
13 years 11 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti
BMCBI
2006
108views more  BMCBI 2006»
13 years 7 months ago
A new pooling strategy for high-throughput screening: the Shifted Transversal Design
Background: In binary high-throughput screening projects where the goal is the identification of low-frequency events, beyond the obvious issue of efficiency, false positives and ...
Nicolas Thierry-Mieg