Virtual Backbones (VBs) are expected to bring substantial benefits to routing in Wireless Sensor Networks (WSNs). Connected Dominating Sets (CDSs) based VBs are competitive approaches among the existing methods used to establish VBs in WSNs. Most existing works focus on constructing Minimum-sized CDSs (MCDSs). However, few works consider the load-balance factor. In this work, the size and the l...

We examine the replica placement aspect of a distributed peer-to-peer le system that replicates and stores les on ordinary desktop computers. It has been shown that some desktop machines are available for a greater fraction of time than others, and it is crucial not to place all replicas of any le on machines with low availability. In this paper we study the eÆcacy of three hill-climbing algori...

We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic program...

Normally distributed data arises in various contexts and often one is interested in estimating its variance. The authors limit themselves in this chapter to the class of estimators that are (positive) multiples of sample variances. Two important qualities of estimators are bias and variance, which respectively capture the estimator’s accuracy and precision. Apart from the two classical estimato...

In the present study a novel method is introduced to detect meaningful regions of a gray-level noisy images of binary structures. The method consists in generating surrogate data for an analyzed image. A surrogate image has the same (or almost the same) power spectrum and histogram of gray-level values as the original one but is random otherwise. Then minmax paths are generated in the original ...

We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programmi...

This paper presents a new method for implementing hierarchical navigation operations in relational database systems as required for applications such as interactive visual explorations over large datasets. A particular class of recursive unions of joins and divisions that operate on hierarchies has been identiied. By using adequate pre-computation (i.e., organizing the hierarchical structure as...

The Farsite distributed le system stores multiple replicas of les on multiple machines, to provide le access even when some machines are unavailable. Farsite assigns le replicas to machines so as to maximally exploit the di erent degrees of availability of di erent machines, given an allowable replication factor R. We use competitive analysis and simulation to study the performance of three can...