1857 search results - page 27 / 372 » Minimum Degree Orderings |
130
click to vote
BROADNETS
2007
IEEE
16 years 1 days ago
2007
IEEE
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
146
click to vote
AINA
2006
IEEE
15 years 11 months ago
2006
IEEE
Pervasive computing is becoming a reality, thanks to advances in wireless networking and increased popularity of portable devices. Users of these devices will need support to deci...
142
click to vote
IWCMC
2006
ACM
15 years 11 months ago
2006
ACM
A new way to determine the exact layer-wise SINR distribution for V-BLAST with successive interference cancellation at the receiver is presented. In contrast to previous publicati...
128
click to vote
COMBINATORICS
2004
15 years 5 months ago
2004
For every real p > 0 and simple graph G, set f (p, G) = uV (G) dp (u) , and let (r, p, n) be the maximum of f (p, G) taken over all Kr+1-free graphs G of order n. We prove tha...
138
click to vote
JCT
2010
15 years 4 months ago
2010
We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d+ 1 ≤ · · · ≤ d+ n and d− 1 ≤ · · · ...