Sciweavers

2924 search results - page 109 / 585
» Lower Bounds in Distributed Computing
Sort
View
COMGEO
2007
ACM
15 years 3 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood
TCOM
2008
116views more  TCOM 2008»
15 years 3 months ago
Bounds on the Distribution of a Sum of Correlated Lognormal Random Variables and Their Application
The cumulative distribution function (cdf) of a sum of correlated or even independent lognormal random variables (RVs), which is of wide interest in wireless communications, remain...
Chintha Tellambura
119
Voted
CCA
2009
Springer
15 years 10 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
224
Voted
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 4 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
ATAL
2009
Springer
15 years 10 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...