2125 search results - page 314 / 425 » On Graph Complexity |
TCS
1998
14 years 9 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
INFFUS
2010
14 years 8 months ago
2010
This paper introduces design principles for modular Bayesian fusion systems which can (i) cope with large quantities of heterogeneous information and (ii) can adapt to changing co...
JUCS
2010
14 years 8 months ago
2010
: Ontologies are used to represent a variety of domain knowledge and data collections, scopes, viewpoints and linked heterogeneous information sources. They range from simple topol...
103
click to vote
PAKDD
2010
ACM
14 years 8 months ago
2010
ACM
Abstract. Within the large body of research in complex network analysis, an important topic is the temporal evolution of networks. Existing approaches aim at analyzing the evolutio...
104
click to vote
ECRTS
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...