16 search results - page 3 / 4 » The rank of connection matrices and the dimension of graph a... |
FSTTCS
2009
Springer
14 years 10 days ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
COMBINATORICS
2006
13 years 5 months ago
2006
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
CDC
2010
IEEE
12 years 9 months ago
2010
IEEE
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...