Sciweavers

162 search results - page 5 / 33
» Study of Lower Bound Functions for MAX-2-SAT
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Delay Analysis for Multi-Hop Wireless Networks
Abstract—We analyze the delay performance of a multihop wireless network with a fixed route between each sourcedestination pair. There are arbitrary interference constraints on ...
Gagan Rajesh Gupta, Ness B. Shroff
TCC
2007
Springer
92views Cryptology» more  TCC 2007»
16 years 18 days ago
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
Hoeteck Wee
ISIPTA
2003
IEEE
15 years 11 months ago
Computing Lower Expectations with Kuznetsov's Independence Condition
Kuznetsov’s condition says that variables X and Y are independent when any product of bounded functions f(X) and g(Y) behaves in a certain way: the interval of expected values E...
Fabio Gagliardi Cozman
SIAMJO
2010
74views more  SIAMJO 2010»
15 years 1 months ago
Various Lipschitz-like Properties for Functions and Sets I: Directional Derivative and Tangential Characterizations
In this work we introduce for extended real valued functions, defined on a Banach space X, the concept of K directionally Lipschitzian behavior, where K is a bounded subset of X. F...
Rafael Correa, Pedro Gajardo, Lionel Thibault
TIT
2011
149views more  TIT 2011»
15 years 1 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...