Sciweavers

2322 search results - page 75 / 465
» On a game in directed graphs
Sort
View
UAI
2008
15 years 7 months ago
Bayesian Out-Trees
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
Tony Jebara
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
15 years 10 months ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers
ARSCOM
2004
104views more  ARSCOM 2004»
15 years 6 months ago
Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...
Klas Markstrom
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
16 years 3 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...
GLOBECOM
2009
IEEE
16 years 28 days 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