Výsledky vyhľadávania - "randomised approximation algorithm"

Byzantine-tolerant uniform node sampling service in large-scale networks Autor 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…”
Získať plný text

Identifying Global Icebergs in Distributed Streams Autor Anceaume, Emmanuelle, Busnel, Yann, Rivetti, Nicolo, Sericola, Bruno

“…We consider the problem of identifying global iceberg attacks in massive and physically distributed streams. A global iceberg is a distributed denial of…”
Získať plný text

Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence Autor van Ieperen, Femke, Kryven, Ivan

“…We discuss sequential stub matching for directed graphs and show that this process can be used to sample simple digraphs with asymptotically equal probability…”
Získať plný text

Minimal Cost Server Configuration for Meeting Time-Varying Resource Demands in Cloud Centers Autor 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…”
Získať plný text

Approximation Algorithms for Online User Association in Multi-Tier Multi-Cell Mobile Networks Autor 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…”
Získať plný text

A Distributed Information Divergence Estimation over Data Streams Autor 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…”
Získať plný text

A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem Autor 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…”
Získať plný text

Uniform node sampling service robust against collusions of malicious nodes Autor 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…”
Získať plný text

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

Získať plný text

Approximation algorithms for maximum cut with limited unbalance Autor 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…”
Získať plný text

Computational experience with a SDP-based algorithm for maximum cut with limited unbalance Autor 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…”
Získať plný text

A simple randomized scheme for constructing low-weight k -connected spanning subgraphs with applications to distributed algorithms Autor 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…”
Získať plný text

Efficiently Summarizing Data Streams over Sliding Windows Autor 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…”
Získať plný text

Randomized Nonnegative Tensor Factorization for Feature Extraction from High-dimensional Signals Autor 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…”
Získať plný text

Estimating the Frequency of Data Items in Massive Distributed Streams Autor 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…”
Získať plný text

Sketch ⋆-Metric: Comparing Data Streams via Sketching Autor 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…”
Získať plný text

An Information Divergence Estimation over Data Streams Autor 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…”
Získať plný text

Approximating average parameters of graphs Autor 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…”
Získať plný text

Triangle Counting in Dynamic Graph Streams Autor 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…”
Získať plný text

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks Autor 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…”
Získať plný text