3268 search results - page 316 / 654 » The hub number of a graph |
144
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
186
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
: Network intrusion detection sensors are usually built around low level models of network traffic. This means that their output is of a similarly low level and as a consequence, ...
156
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
There are many applications of the enumeration of maps in surfaces to other areas of mathematics and the physical sciences. In particular, in quantum field theory and string theo...
159
click to vote
PAMI
2006
15 years 6 months ago
2006
In this paper, we present a generative sketch model for human hair analysis and synthesis. We treat hair images as 2D piecewisely smooth vector (flow) fields, and thus our represe...
164
click to vote
TCS
2008
15 years 6 months ago
2008
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...