4913 search results - page 137 / 983 » Results and Perspectives of the G |
169
click to vote
COMBINATORICS
2006
15 years 6 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. ...
163
click to vote
JCM
2007
15 years 6 months ago
2007
— This paper investigates the impact of security on the performance of WLAN. More specifically, it analyzes the impact of different implementations of encryption techniques used ...
150
click to vote
SIAMDM
2002
15 years 6 months ago
2002
Let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on c...
184
click to vote
TAMC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
171
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
This paper presents a general solution to the determination of the pose of a perspective camera with unknown focal length from images of four 3D reference points. Our problem is a...