Sciweavers

2612 search results - page 36 / 523
» Switching Graphs and Their Complexity
Sort
View
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 10 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 10 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
MLG
2007
Springer
14 years 4 months ago
Transductive Rademacher Complexities for Learning Over a Graph
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
Kristiaan Pelckmans, Johan A. K. Suykens
EMMCVPR
2009
Springer
14 years 1 months ago
Complex Diffusion on Scalar and Vector Valued Image Graphs
Complex diffusion was introduced in the image processing literature as a means to achieve simultaneous denoising and enhancement of scalar valued images. In this paper, we present ...
Dohyung Seo, Baba C. Vemuri
FLOPS
2010
Springer
14 years 4 months ago
Complexity Analysis by Graph Rewriting
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
Martin Avanzini, Georg Moser