Optimizing Mix-zone Coverage in Pervasive Wireless Networks

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

This article investigates the performance and accuracy of continuous Real-Time Kinematic (RTK) Global Navigation Satellite System (GNSS) position tracking for hydromorphological surveys, based on a comprehensive river restoration monitoring campaign. The a ...

Distributed learning is the key for enabling training of modern large-scale machine learning models, through parallelising the learning process. Collaborative learning is essential for learning from privacy-sensitive data that is distributed across various ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, one removes a small ...

Although encryption hides the content of communications from third parties, metadata, i.e., the information attached to the content (such as the size or timing of communication) can be a rich source of details and context. In this dissertation, we demonstr ...

In recent years, several industries have widely applied BLDC servomotors for various purposes that they almost need a control system to be accurate and robust. In this paper, we compare an adaptive fuzzy controller and PI controller for BLDC servomotor pos ...

With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...

Traffic congestion constitutes one of the most frequent, yet challenging, problems to address in the urban space. Caused by the concentration of population, whose mobility needs surpass the serving capacity of urban networks, congestion cannot be resolved ...

We exhibit an unambiguous k-DNF formula that requires CNF width (Omega) over tilde (k(2)), which is optimal up to logarithmic factors. As a consequence, we get a near-optimal solution to the Alon-Saks-Seymour problem in graph theory (posed in 1991), which ...

Future low-carbon societies will need to store vast amounts of electricity to stabilize electricity grids and to power electric vehicles. Vehicle-to-grid allows vehicle owners and grid operators to share the costs of electricity storage by making the batte ...

Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority vertex. We study th ...

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges, but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows for the generation of graphs with extens ...

In the digital era, users share their personal data with service providers to obtain some utility, e.g., access to high-quality services. Yet, the induced information flows raise privacy and integrity concerns. Consequently, cautious users may want to prot ...

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...

This article introduces a new class of models for multiple networks. The core idea is to parameterize a distribution on labeled graphs in terms of a Frechet mean graph (which depends on a user-specified choice of metric or graph distance) and a parameter t ...

An abstract topological graph (briefly an AT-graph) is a pair A = (G, X) where G = (V, E) is a graph and X. E2 is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from X crosses exac ...

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev [Khot S, Regev O (2008) Vertex cover might be hard to approximate to within 2 - epsilon. J. Comput. System Sci. 74(3): 335-349 ...

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

This paper presents a strategy for providing reliable state estimates that allow a group of robots to realize a formation even when communication fails and the tracking data alone is insufficient for maintaining a stable formation. Furthermore, the trackin ...

Multiview applications endow final users with the possibility to freely navigate within 3D scenes with minimum-delay. A real feeling of scene navigation is enabled by transmitting multiple high-quality camera views, which can be used to synthesize addition ...

Optimizing Mix-zone Coverage in Pervasive Wireless Networks

Chat with Graph Search

Performance and accuracy of cross‐section tracking methods for hydromorphological habitat assessment in wadable rivers with sparse canopy conditions

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

Results on Sparse Integer Programming and Geometric Independent Sets

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes

Protecting privacy through metadata analysis

Comparison of PI and Adaptive Fuzzy Controllers for Position Tracking of Servo System with Variable Loaded BLDC Motor

Space-Efficient Representations of Graphs

Large-scale traffic signal control and multimodal network design

Unambiguous DNFs and Alon-Saks-Seymour

Vehicle-to-Grid for Reliable Frequency Regulation

Adaptive majority problems for restricted query graphs and for weighted sets

Atomic subgraphs and the statistical mechanics of networks

Privacy and Integrity Preserving Computations with CRISP

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Modeling Network Populations via Graph Distances

Simple Realizability of Complete Abstract Topological Graphs Simplified

No Small Linear Program Approximates Vertex Cover Within a Factor 2-epsilon

New Graph Algorithms via Polyhedral Techniques

A robust localization system for multi-robot formations based on an extension of a Gaussian mixture probability hypothesis density filter

Adaptive Streaming in Interactive Multiview Video Systems