147 search results - page 24 / 30 » The Number of Independent Sets in a Graph with Small Maximum... |
ML
2000
ACM
13 years 7 months ago
2000
ACM
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
SADM
2011
13 years 2 months ago
2011
Abstract: Visualizing data by graphing a response against certain factors, and conditioning on other factors, has arisen independently in many contexts. One is the interaction plot...
SPAA
2003
ACM
14 years 19 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
NETWORKS
2007
13 years 6 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...