Sciweavers

16504 search results - page 405 / 3301
» New Problems, New Solutions
Sort
View
CVPR
2010
IEEE
16 years 3 months ago
Beyond Trees: MRF Inference via Outer-Planar Decomposition
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
Dhruv Batra, Andrew Gallagher, Devi Parikh, Tsuhan...
JOTA
2011
98views more  JOTA 2011»
15 years 1 months ago
Generic Stability and Essential Components of Generalized KKM Points and Applications
We propose the definition of T-KKM points and consider generic stability of T-KKM mappings and essential components of sets of T-KKM points. As applications, using a unified appr...
Phan Quoc Khanh, Nguyen Hong Quan
WINET
2011
15 years 1 months ago
Aggregation convergecast scheduling in wireless sensor networks
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
Baljeet Malhotra, Ioanis Nikolaidis, Mario A. Nasc...
IPMI
2011
Springer
14 years 10 months ago
Surface-Region Context in Optimal Multi-object Graph-Based Segmentation: Robust Delineation of Pulmonary Tumors
Abstract. Multi-object segmentation with mutual interaction is a challenging task in medical image analysis. We report a novel solution to a segmentation problem, in which target o...
Qi Song, Mingqing Chen, Junjie Bai, Milan Sonka, X...
ANOR
2008
171views more  ANOR 2008»
15 years 7 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet