Sciweavers

5404 search results - page 178 / 1081
» Global Computing for Bioinformatics
Sort
View
AAAI
2008
15 years 6 months ago
The Parameterized Complexity of Global Constraints
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
MVA
2000
166views Computer Vision» more  MVA 2000»
15 years 5 months ago
Motion Segmentation and Tracking by Embedding Global Model Within a Contextual Relaxation Scheme
IAPR Workshop on Machine Vision and Applications, pp. 455-458, 2000, Tokyo, Japan In this paper, we integrate the model-based tracking and local contexture (temporal and spatial) ...
Yunqiang Chen, Thomas S. Huang
EOR
2006
66views more  EOR 2006»
15 years 4 months ago
Using intervals for global sensitivity and worst-case analyses in multiattribute value trees
Sensitivity analyses have long been used to assess the impacts of uncertainties on outcomes of decision models. Several approaches have been suggested, but it has been problematic...
Jyri Mustajoki, Raimo P. Hämäläinen...
PAMI
2006
180views more  PAMI 2006»
15 years 4 months ago
Globally Minimal Surfaces by Continuous Maximal Flows
In this paper we consider the problem of computing globally minimal continuous curves and surfaces for image segmentation and 3D reconstruction. This is solved using a maximal flo...
Ben Appleton, Hugues Talbot
SIAMJO
2010
87views more  SIAMJO 2010»
15 years 2 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson