Sciweavers

11565 search results - page 160 / 2313
» Computing Minimal Mappings
Sort
View
GD
2003
Springer
15 years 9 months ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann
WCE
2007
15 years 5 months ago
A Multidimensional Bisection Method for Minimizing Function over Simplex
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
A. N. Baushev, E. Y. Morozova
SCL
2010
105views more  SCL 2010»
14 years 11 months ago
Asymptotic approach on conjugate points for minimal time bang-bang controls
We focus on the minimal time control problem for single-input control-affine systems x = X(x) + u1Y1(x) in IRn with fixed initial and final time conditions x(0) = ^x0, x(tf ) = ^x...
C. J. Silva, Emmanuel Trélat
EMMCVPR
1999
Springer
15 years 8 months ago
A New Algorithm for Energy Minimization with Discontinuities
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICDM
2009
IEEE
145views Data Mining» more  ICDM 2009»
15 years 2 months ago
Significance of Episodes Based on Minimal Windows
Discovering episodes, frequent sets of events from a sequence has been an active field in pattern mining. Traditionally, a level-wise approach is used to discover all frequent epis...
Nikolaj Tatti