Sciweavers

1056 search results - page 194 / 212
» Constraint-Based Graph Matching
Sort
View
MFCS
2010
Springer
13 years 6 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
MOR
2010
118views more  MOR 2010»
13 years 6 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
ICIP
2010
IEEE
13 years 5 months ago
An automated vertebra identification and segmentation in CT images
In this paper, we propose a new 3D framework to identify and segment VBs and TBs in clinical computed tomography (CT) images without any user intervention. The Matched filter is e...
Melih S. Aslan, Asem M. Ali, Ham Rara, Aly A. Fara...
ACCV
2010
Springer
13 years 2 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
JMLR
2010
165views more  JMLR 2010»
13 years 2 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...