4524 search results - page 93 / 905 » The Complexity of Global Constraints |
118
click to vote
PAMI
2006
15 years 16 days ago
2006
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...
116
click to vote
SIAMJO
2010
14 years 11 months ago
2010
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
120
Voted
ASPDAC
2012
ACM
13 years 8 months ago
2012
ACM
In this paper, we examine the integration potential and explore the design space of low power thermal reliable on-chip interconnect synthesis featuring nanophotonics Wavelength Di...
96
Voted
JSYML
2008
15 years 17 days ago
2008
In a previous paper with M. Dzamonja, class forcings were given which fixed the complexity (a universality covering number) for certain types of structures of size together with ...
116
Voted
ICS
2009
Tsinghua U.
14 years 10 months ago
2009
Tsinghua U.
Modern processors require highly accurate branch prediction for good performance. As such, a number of branch predictors have been proposed with varying size and complexity. This ...