Sciweavers

27 search results - page 5 / 6
» Connecting the dots with related notes
Sort
View
OSN
2008
97views more  OSN 2008»
13 years 5 months ago
Managing Layer 1 VPN services
Control Plane architectures enhance transport networks with distributed signaling and routing mechanisms which allow dynamic connection control. As a result, layer 1 switching net...
Neumar Malheiros, Edmundo Roberto Mauro Madeira, F...
MOBICOM
2006
ACM
13 years 11 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
DC
2007
13 years 5 months ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 9 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
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 {...
Sushant Patnaik, Neil Immerman
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 6 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...