614 search results - page 56 / 123 » Local Computation: Lower and Upper Bounds |
GLOBECOM
2007
IEEE
15 years 1 months ago
2007
IEEE
The throughput of delay sensitive traffic in a Rayleigh fading network is studied by adopting a scaling limit approach. The case of study is that of a pair of nodes establishing a ...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
SMA
2010
ACM
14 years 10 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
RTCSA
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
103
click to vote
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...