270 search results - page 51 / 54 » Matching graphs of Hypercubes and Complete Bipartite Graphs |
SIROCCO
2004
13 years 10 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
PODS
1994
ACM
14 years 19 days ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...
OOPSLA
2007
Springer
14 years 2 months ago
2007
Springer
Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogona...