Sciweavers

151 search results - page 11 / 31
» Optimal (2, n) visual cryptographic schemes
Sort
View
TIT
2010
114views Education» more  TIT 2010»
13 years 2 months ago
The balanced unicast and multicast capacity regions of large wireless networks
We consider the question of determining the scaling of the n2 -dimensional balanced unicast and the n2n dimensional balanced multicast capacity regions of a wireless network with ...
Urs Niesen, Piyush Gupta, Devavrat Shah
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
13 years 11 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 2 months ago
On Communication over Unknown Sparse Frequency-Selective Block-Fading Channels
The problem of reliable communication over unknown frequency-selective block-fading channels with sparse impulse responses is considered. In particular, discrete-time impulse respo...
Arun Pachai Kannu, Philip Schniter
ISVC
2010
Springer
13 years 5 months ago
Interpolating 3D Diffusion Tensors in 2D Planar Domain by Locating Degenerate Lines
Interpolating diffusion tensor fields is a key technique to visualize the continuous behaviors of biological tissues such as nerves and muscle fibers. However, this has been stil...
Chongke Bi, Shigeo Takahashi, Issei Fujishiro
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 2 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert