Algorithms for Sensor Systems
10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, Wroclaw, Poland, September 12, 2014, Revised Selected Papers
Page
%P
-
Article
Open AccessPrediction and prevention of pandemics via graphical model inference and convex programming
Hard-to-predict bursts of COVID-19 pandemic revealed significance of statistical modeling which would resolve spatio-temporal correlations over geographical areas, for example spread of the infection over a ci...
-
Chapter and Conference Paper
Polygons with Prescribed Angles in 2D and 3D
We consider the construction of a polygon P with n vertices whose turning angles at the vertices are given by a sequence $$A=(\alpha _...
-
Article
Nearest-Neighbor Searching Under Uncertainty I
Nearest-neighbor queries, which ask for returning the nearest neighbor of a query point in a set of points, are important and widely studied in many fields because of a wide range of applications. In many of t...
-
Book and Conference Proceedings
-
Article
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS for the problem, as well as a linear-time algorithm for t...
-
Article
Optimization Schemes for Protective Jamming
In this paper, we study strategies for allocating and managing friendly jammers, so as to create virtual barriers that would prevent hostile eavesdroppers from tap** sensitive wireless communication. Our sch...
-
Chapter and Conference Paper
MobiSLIC: Content-Aware Energy Saving for Educational Videos on Mobile Devices
We present a context-aware system that simultaneously increases energy-efficiency and readability for educational videos on smartphones with OLED displays. Our system analyzes the content of each frame of the ...
-
Chapter and Conference Paper
MapSets: Visualizing Embedded and Clustered Graphs
We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm, which guarantees the contiguity and disjointness of the reg...
-
Chapter and Conference Paper
Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box
We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS for the problem, as well as a linear-time algorithm for t...
-
Chapter
On Approximate Geodesic-Distance Queries amid Deforming Point Clouds
We propose data structures for answering a geodesic-distance query between two query points in a two-dimensional or three-dimensional dynamic environment, in which obstacles are deforming continuously. Each ob...
-
Article
Algorithm design for a class of base station location problems in sensor networks
Base station placement has significant impact on sensor network performance. Despite its significance, results on this problem remain limited, particularly theoretical results that can provide performance guar...
-
Chapter and Conference Paper
Improved Approximation Algorithms for Relay Placement
In the relay placement problem the input is a set of sensors and a number r ≥ 1, the communication range of a relay. The objective is to place a minimum number of relays so that between every pair of sensors ther...
-
Article
Finding a Guard that Sees Most and a Shop that Sells Most
We present a near-quadratic time algorithm that computes a point inside a simple polygon P in the plane having approximately the largest visibility polygon inside P, and a near-linear time algorithm for findin...
-
Article
Curve Matching, Time War**, and Light Fields: New Algorithms for Computing Similarity between Curves
The problem of curve matching appears in many application domains, like time series analysis, shape matching, speech recognition, and signature verification, among others. Curve matching has been studied exten...
-
Article
On the Union of κ-Round Objects in Three and Four Dimensions
A compact set c in \({\Bbb R}^d\) is κ-round if for every point
-
Article
Pattern Matching for Sets of Segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consists of a collection of orthogonal segments in the plane. Such collections arise naturally from ...
-
Chapter and Conference Paper
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular-arcs as edges, given a one-to-one map** between the vertices of the graph and a set of n points on the plane, where n is the number...
-
Article
Covering with Ellipses
We address the problem of how to cover a set of required points by a small number of axis-parallel ellipses that avoid a second set of forbidden points. We study geometric properties of such covers and ...
-
Article
Search the Audio, Browse the Video—A Generic Paradigm for Video Collections
The amount of digital video being shot, captured, and stored is growing at a rate faster than ever before. The large amount of stored video is not penetrable without efficient video indexing, retrieval, and br...
-
Chapter and Conference Paper
Computing Homotopic Shortest Paths Efficiently
We give algorithms to find shortest paths homotopic to given disjoint paths that wind amongst n point obstacles in the plane. Our deterministic algorithm runs in time O(k log n+n√n), and the randomized version in...
