Sciweavers

2270 search results - page 260 / 454
» On the distribution of eigenvalues of graphs
Sort
View
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
16 years 14 days ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ICPR
2006
IEEE
16 years 7 months ago
A Unified Formulation of Invariant Point Pattern Matching
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
Terry Caelli, Tibério S. Caetano
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
16 years 3 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
GLOBECOM
2009
IEEE
16 years 1 months ago
Strong Barrier Coverage with Directional Sensors
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
Li Zhang, Jian Tang, Weiyi Zhang
GLOBECOM
2009
IEEE
16 years 1 months ago
Fusion and Diversity Trade-Offs in Cooperative Estimation over Fading Channels
—In this paper we consider a network of distributed sensors that are trying to measure a parameter of interest cooperatively, by exchanging their acquired information repeatedly ...
Mehrzad Malmirchegini, Yasamin Mostofi