Sciweavers

672 search results - page 62 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
89
Voted
ATAL
2009
Springer
15 years 7 months ago
Self-organising agent organisations
Self-organising multi-agent systems provide a suitable paradigm for developing autonomic computing systems that manage themselves. Towards this goal, we demonstrate a robust, dece...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...
114
Voted
JMLR
2010
115views more  JMLR 2010»
14 years 11 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
15 years 9 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
91
Voted
ICCV
2011
IEEE
14 years 18 days ago
Object Detection and Segmentation from Joint Embedding of Parts and Pixels
We present a new framework in which image segmentation, figure/ground organization, and object detection all appear as the result of solving a single grouping problem. This frame...
Michael Maire, Stella X. Yu, Pietro Perona
ICPR
2006
IEEE
16 years 1 months ago
A Unified Formulation of Invariant Point Pattern Matching
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
Terry Caelli, Tibério S. Caetano