Sciweavers

483 search results - page 62 / 97
» On perfectness of sums of graphs
Sort
View
PPL
2007
112views more  PPL 2007»
13 years 8 months ago
Embodied Computation
The traditional computational devices and models, such as the von Neumann architecture or the Turing machine, are strongly influenced by concepts of central control and perfectio...
Heiko Hamann, Heinz Wörn
FOCM
2011
117views more  FOCM 2011»
13 years 3 months ago
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...
Folkmar Bornemann
ICPR
2008
IEEE
14 years 3 months ago
Tree-serial dynamic programming for image processing
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
Andrey Kopylov
COCOON
2010
Springer
14 years 1 months ago
Imbalance Is Fixed Parameter Tractable
In the Imbalance Minimization problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of...
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
NETWORKS
2008
13 years 8 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...