Sciweavers

3267 search results - page 324 / 654
» Generalized quasirandom graphs
Sort
View
ICCS
2004
Springer
16 years 4 days ago
An Application of the DEDS Control Synthesis Method
Abstract: An application of the method suitable for modelling and control of general discrete event dynamic systems (DEDS) to special kinds of communication systems is presented in...
Frantisek Capkovic
ICIP
1998
IEEE
15 years 11 months ago
Segmentation as a Riemannian Drum Problem
1 In this paper, the segmentation problem is formulated as a problem of segmenting a Riemannian manifold. The image domain is endowed with an anisotropic metric and its segmentatio...
Jayant Shah
GECCO
2008
Springer
119views Optimization» more  GECCO 2008»
15 years 7 months ago
Evolutionary synthesis of low-sensitivity equalizers using adjacency matrix representation
An evolutionary synthesis method to design low-sensitivity IIR filters with linear phase in the passband is presented. The method uses a chromosome coding scheme based on the grap...
Leonardo Bruno de Sá, Antonio Carneiro Mesq...
EJC
2008
15 years 6 months ago
Grad and classes with bounded expansion I. Decompositions
Abstract. We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new ...
Jaroslav Nesetril, Patrice Ossona de Mendez
JNSM
2006
78views more  JNSM 2006»
15 years 6 months ago
Edge-Cut Bounds on Network Coding Rates
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
Gerhard Kramer, Serap A. Savari