Sciweavers

62 search results - page 8 / 13
» On embedding complete graphs into hypercubes
Sort
View
COLT
2008
Springer
13 years 9 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
SIGAL
1990
273views Algorithms» more  SIGAL 1990»
13 years 11 months ago
Randomized Broadcast in Networks
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
Uriel Feige, David Peleg, Prabhakar Raghavan, Eli ...
ICALP
2010
Springer
14 years 5 days ago
Compositionality in Graph Transformation
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Arend Rensink
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
14 years 2 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Krishnam Raju Jampani, Anna Lubiw
VLSID
2008
IEEE
138views VLSI» more  VLSID 2008»
14 years 7 months ago
Memory Architecture Exploration Framework for Cache Based Embedded SOC
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and l...
T. S. Rajesh Kumar, C. P. Ravikumar, R. Govindaraj...