GC
2007
Springer
13 years 11 months ago
2007
Springer
Let G be a connected graph of order n and girth g. If dG(u) + dG(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bou...
EOR
2007
13 years 11 months ago
2007
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
13 years 11 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
JMLR
2006
13 years 11 months ago
2006
In this paper we prove the optimality of an aggregation procedure. We prove lower bounds for aggregation of model selection type of M density estimators for the Kullback-Leibler d...
JMIV
2006
13 years 11 months ago
2006
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
EJC
2007
13 years 11 months ago
2007
We give an extension of the lower bound of [9] for the number of Tverberg partitions from the prime to the prime power case. Our proof is inspired by the Zp-index version of the p...
JGT
2006
13 years 11 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
JSYML
2008
13 years 11 months ago
2008
Abstract. We prove new upper bound theorems on the consistency strengths of SPFA(), SPFA(-linked) and SPFA(+ -cc). Our results are in terms of (, )-subcompactness, which is a new l...
JCSS
2006
13 years 11 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
JPDC
2008
13 years 11 months ago
2008
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...