Sciweavers

2746 search results - page 265 / 550
» Bisubmodular Function Minimization
Sort
View
CVPR
2004
IEEE
16 years 6 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 5 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
DAC
2009
ACM
15 years 11 months ago
Clock skew optimization via wiresizing for timing sign-off covering all process corners
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
SAGA
2009
Springer
15 years 11 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
SMI
2008
IEEE
198views Image Analysis» more  SMI 2008»
15 years 11 months ago
Anisotropic geodesic distance computation for parametric surfaces
The distribution of geometric features is anisotropic by its nature. Intrinsic properties of surfaces such as normal curvatures, for example, varies with direction. In this paper ...
Joon-Kyung Seong, Won-Ki Jeong, Elaine Cohen