Sciweavers

4524 search results - page 95 / 905
» The Complexity of Global Constraints
Sort
View
DICTA
2003
15 years 2 months ago
Globally Optimal Surfaces by Continuous Maximal Flows
Abstract. In this paper we solve the problem of computing exact continuous optimal curves and surfaces for image segmentation and 3D reconstruction, using a maximal flow approach ...
Ben Appleton, Hugues Talbot
84
Voted
AMC
2005
138views more  AMC 2005»
15 years 16 days ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
148
Voted
CVPR
2011
IEEE
14 years 8 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang
103
Voted
IEEESCC
2007
IEEE
15 years 7 months ago
Brave New Web: Emerging Design Principles and Technologies as Enablers of a Global SOA
Web Services have experienced great interest during the last years as they were expected to play a key role as enablers of seamless application-to-application integration both wit...
Christoph Schroth, Oliver Christ
MICRO
2010
IEEE
149views Hardware» more  MICRO 2010»
14 years 10 months ago
Improving SIMT Efficiency of Global Rendering Algorithms with Architectural Support for Dynamic Micro-Kernels
Wide Single Instruction, Multiple Thread (SIMT) architectures often require a static allocation of thread groups that are executed in lockstep throughout the entire application ker...
Michael Steffen, Joseph Zambreno