123 search results - page 10 / 25 » Computing upper and lower bounds on likelihoods in intractab... |
INFOCOM
2012
IEEE
12 years 5 months ago
2012
IEEE
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy
conditions and communication costs. This is motivated by a
numbe...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
The management of networks has often been ignored in network-based computing systems due to the difficulty of estimating application programs' network latency and bandwidth r...
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...