Sciweavers

92 search results - page 11 / 19
» An Optimal Lower Bound on the Number of Variables for Graph ...
Sort
View
TMC
2008
104views more  TMC 2008»
13 years 7 months ago
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....
GD
2001
Springer
14 years 6 days ago
Orthogonal Drawings with Few Layers
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
Therese C. Biedl, John R. Johansen, Thomas C. Sher...
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 8 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
IANDC
2006
102views more  IANDC 2006»
13 years 7 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 7 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...