Sciweavers

866 search results - page 20 / 174
» Extension of the direct optimization algorithm for noisy fun...
Sort
View
AMC
2005
138views more  AMC 2005»
13 years 6 months 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
SODA
2008
ACM
75views Algorithms» more  SODA 2008»
13 years 8 months ago
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
S. Thomas McCormick, Satoru Fujishige
SIGMETRICS
2009
ACM
135views Hardware» more  SIGMETRICS 2009»
14 years 1 months ago
Scheduling in multi-channel wireless networks: rate function optimality in the small-buffer regime
We consider the problem of designing scheduling algorithms for the downlink of cellular wireless networks where bandwidth is partitioned into tens to hundreds of parallel channels...
Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R...
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
13 years 10 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
CVPR
2008
IEEE
14 years 8 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal