Sciweavers

272 search results - page 1 / 55
» Minimal Function Graphs are not Instrumented
Sort
View
SAS
1992
Springer
14 years 2 months ago
Minimal Function Graphs are not Instrumented
Alan Mycroft, Mads Rosendahl
ECCV
2002
Springer
15 years 20 days ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
JMMA
2010
162views more  JMMA 2010»
13 years 5 months ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
PPSN
2004
Springer
14 years 4 months ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our Î...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...