Sciweavers

2503 search results - page 391 / 501
» A study of 3-arc graphs
Sort
View
CCCG
2010
13 years 11 months ago
Direction assignment in wireless networks
In this paper we consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of...
Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthe...
CCCG
1998
13 years 11 months ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca
COLING
2000
13 years 11 months ago
Generation, Lambek Calculus, Montague's Semantics and Semantic Proof Nets
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...
Sylvain Pogodalla
NIPS
1998
13 years 11 months ago
Inference in Multilayer Networks via Large Deviation Bounds
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
Michael J. Kearns, Lawrence K. Saul
SODA
1997
ACM
106views Algorithms» more  SODA 1997»
13 years 11 months ago
Optimal Bounds for Matching Routing on Trees
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
Louxin Zhang