Sciweavers

3211 search results - page 154 / 643
» On the Grundy Number of a Graph
Sort
View
CDC
2010
IEEE
172views Control Systems» more  CDC 2010»
14 years 10 months ago
Electrical centrality measures for electric power grid vulnerability analysis
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
Zhifang Wang, Anna Scaglione, Robert J. Thomas
PODC
2011
ACM
14 years 9 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ICCV
2011
IEEE
14 years 6 months ago
Probabilistic Group-Level Motion Analysis and Scenario Recognition
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...
Ming-Ching Chang, Nils Krahnstoever, Weina Ge
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
14 years 2 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
CORR
2006
Springer
88views Education» more  CORR 2006»
15 years 6 months ago
A Graph-based Framework for Transmission of Correlated Sources over Broadcast Channels
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
Suhan Choi, S. Sandeep Pradhan