Sciweavers

2299 search results - page 127 / 460
» A Class of Hypercube-Like Networks
Sort
View
IDEAS
2009
IEEE
129views Database» more  IDEAS 2009»
13 years 7 months ago
Speeding-up data-driven applications with program summaries
We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution...
Sonia Guehis, Virginie Goasdoué-Thion, Phil...
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
13 years 5 months ago
A lower bound for distributed averaging algorithms on the line graph
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
Alexander Olshevsky, John N. Tsitsiklis
CORR
2011
Springer
164views Education» more  CORR 2011»
13 years 1 months ago
Lipschitz Games
The Lipschitz constant of a finite normal–form game is the maximal change in some player’s payoff when a single opponent changes his strategy. We prove that games with small ...
Yaron Azrieli, Eran Shmaya
ICASSP
2011
IEEE
13 years 1 months ago
Factor graph-based structural equilibria in dynamical games
Correlated equilibria are a generalization of Nash equilibria that permit agents to act in a correlated manner and can therefore, model learning in games. In this paper we define...
Liming Wang, Vikram Krishnamurthy, Dan Schonfeld
INFOCOM
2012
IEEE
12 years 8 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...