Sciweavers

63 search results - page 11 / 13
» Two-coloring Random Hypergraphs
Sort
View
118
Voted
TCOM
2010
167views more  TCOM 2010»
14 years 10 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
CEC
2009
IEEE
15 years 6 months ago
Evolving hypernetwork models of binary time series for forecasting price movements on stock markets
— The paper proposes a hypernetwork-based method for stock market prediction through a binary time series problem. Hypernetworks are a random hypergraph structure of higher-order...
Elena Bautu, Sun Kim, Andrei Bautu, Henri Luchian,...
COLT
2004
Springer
15 years 5 months ago
Learning a Hidden Graph Using O(log n) Queries Per Edge
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
Dana Angluin, Jiang Chen
95
Voted
JCT
2010
109views more  JCT 2010»
14 years 10 months ago
Avoider-Enforcer: The rules of the game
An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph F ⊆ 2X . The players claim previously unoccupied elements of the board X in turns...
Dan Hefetz, Michael Krivelevich, Milos Stojakovic,...
91
Voted
FOCS
2007
IEEE
15 years 6 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák