Search Results - "Randomized approximation algorithm"

Minimal Cost Server Configuration for Meeting Time-Varying Resource Demands in Cloud Centers by Liu, Chubo, Li, Kenli, Li, Keqin

“…We consider the minimal cost server configuration for meeting resource demands over multiple time slots. Specifically, there are some heterogeneous servers…”
Get full text

Approximation Algorithms for Online User Association in Multi-Tier Multi-Cell Mobile Networks by Weng Chon Ao, Psounis, Konstantinos

“…The constantly growing wireless bandwidth demand is pushing wireless networks to multi-tier architectures consisting of a macrocell tier and a number of dense…”
Get full text

A Distributed Information Divergence Estimation over Data Streams by Anceaume, Emmanuelle, Busnel, Yann

“…In this paper, we consider the setting of large scale distributed systems, in which each node needs to quickly process a huge amount of data received in the…”
Get full text

A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem by Gehweiler, Joachim, Lammersen, Christiane, Sohler, Christian

“…We investigate a metric facility location problem in a distributed setting. In this problem, we assume that each point is a client as well as a potential…”
Get full text

Uniform node sampling service robust against collusions of malicious nodes by Anceaume, Emmanuelle, Busnel, Yann, Sericola, Bruno

“…We consider the problem of achieving uniform node sampling in large scale systems in presence of a strong adversary. We first propose an omniscient strategy…”
Get full text

A Distributed Algorithm for the Facility Location Problem by Gehweiler, Joachim, Lammersen, Christiane, Sohler, Christian

Get full text

Approximation algorithms for maximum cut with limited unbalance by Galbiati, Giulia, Maffioli, Francesco

“…We consider the problem of partitioning the vertices of a weighted graph into two sets of sizes that differ at most by a given threshold B , so as to maximize…”
Get full text

Computational experience with a SDP-based algorithm for maximum cut with limited unbalance by Galbiati, Giulia, Gualandi, Stefano, Maffioli, Francesco

“…In the Maximum Cut with Limited Unbalance problem, we want to partition the vertices of a weighted graph into two sets of sizes differing at most by a given…”
Get full text

A simple randomized scheme for constructing low-weight k -connected spanning subgraphs with applications to distributed algorithms by Khan, Maleq, Pandurangan, Gopal, Anil Kumar, V.S.

“…The main focus of this paper is the analysis of a simple randomized scheme for constructing low-weight k -connected spanning subgraphs. In this paper, we focus…”
Get full text

Efficiently Summarizing Data Streams over Sliding Windows by Rivetti, Nicolo, Busnel, Yann, Mostefaoui, Achour

“…Estimating the frequency of any piece of information in large-scale distributed data streams became of utmost importance in the last decade (e.g., in the…”
Get full text

Randomized Nonnegative Tensor Factorization for Feature Extraction from High-dimensional Signals by Zdunek, Rafal, Fonal, Krzysztof

“…Tensor decomposition methods are well-known tools for multilinear feature extraction from multi-way arrays with many important applications in signal…”
Get full text

Estimating the Frequency of Data Items in Massive Distributed Streams by Anceaume, Emmanuelle, Busnel, Yann, Rivetti, Nicolo

“…We investigate the problem of estimating on the fly the frequency at which items recur in large scale distributed data streams, which has become the norm in…”
Get full text

Sketch ⋆-Metric: Comparing Data Streams via Sketching by Anceaume, Emmanuelle, Busnel, Yann

“…In this paper, we consider the problem of estimating the distance between any two large data streams in small-space constraint. This problem is of utmost…”
Get full text

An Information Divergence Estimation over Data Streams by Anceaume, E., Busnel, Y.

“…In this paper, we consider the setting of large scale distributed systems, in which each node needs to quickly process a huge amount of data received in the…”
Get full text

Approximating average parameters of graphs by Goldreich, Oded, Ron, Dana

“…Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we…”
Get full text

Triangle Counting in Dynamic Graph Streams by Bulteau, Laurent, Froese, Vincent, Kutzkov, Konstantin, Pagh, Rasmus

“…Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the…”
Get full text

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks by Khan, M., Pandurangan, G., Anil Kumar, V.S.

“…While there are distributed algorithms for the MST problem, these algorithms require relatively large number of messages and time; this makes these algorithms…”
Get full text

Byzantine-tolerant uniform node sampling service in large-scale networks by Anceaume, Emmanuelle, Busnel, Yann, Sericola, Bruno

“…We consider the problem of achieving uniform node sampling in large scale systems in presence of Byzantine nodes. This service offers a single simple primitive…”
Get full text

Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks by Berman, Piotr, DasGupta, Bhaskar, Sontag, Eduardo

“…In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our…”
Get full text

Probabilistic verification and approximation by Lassaigne, Richard, Peyronnet, Sylvain

“…We study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems. Models of such systems are labelled…”
Get full text