Sciweavers

528 search results - page 103 / 106
» Fault-tolerant analysis of a class of networks
Sort
View
75
Voted
ICDT
2010
ACM
219views Database» more  ICDT 2010»
15 years 6 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
SPAA
2009
ACM
15 years 4 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
CCS
2009
ACM
15 years 4 months ago
False data injection attacks against state estimation in electric power grids
A power grid is a complex system connecting electric power generators to consumers through power transmission and distribution networks across a large geographical area. System mo...
Yao Liu, Michael K. Reiter, Peng Ning
77
Voted
ICPADS
2007
IEEE
15 years 3 months ago
A scheduling algorithm for revenue maximisation for cluster-based Internet services
This paper proposes a new priority scheduling algorithm to maximise site revenue of session-based multi-tier Internet services in a multicluster environment. This research is part...
James Wen Jun Xue, Ligang He, Stephen A. Jarvis
COCOON
2007
Springer
15 years 3 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...