231 search results - page 26 / 47 » The Number of Independent Sets in a Regular Graph |
180
Voted
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
177
click to vote
FCS
2009
15 years 3 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
174
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
175
click to vote
ISAAC
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
190
click to vote
WADS
2007
Springer
16 years 5 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...