###
*Nonnumerical* *Algorithms* and Problems—computations

"... A simple indicator for an anomaly in a network is a rapid increase in the total number of distinct network connections. While it is fairly easy to maintain an accurate estimate of the current total number of distinct connections using streaming algorithms that exhibit both a low space and computatio ..."

Abstract
- Add to MetaCart

A simple indicator for an anomaly in a network is a rapid increase in the total number of distinct network connections. While it is fairly easy to maintain an accurate estimate of the current total number of distinct connections using streaming

*algorithms*that exhibit both a low space###
*Nonnumerical* *Algorithms* and Problems—Computations

"... We give a randomized (Las-Vegas) parallel algorithm for computing strongly connected components of a graph with n vertices and m edges. The runtime is dominated by O(log 2 n) multi-source parallel reachability queries; i.e. O(log 2 n) calls to a subroutine that computes the union of the descendants ..."

Abstract
- Add to MetaCart

We give a randomized (Las-Vegas) parallel

*algorithm*for computing strongly connected components of a graph with n vertices and m edges. The runtime is dominated by O(log 2 n) multi-source parallel reachability queries; i.e. O(log 2 n) calls to a subroutine that computes the union of the descendants###
*Nonnumerical* *Algorithms* and Problems

"... We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shrivastava et al. [21]. Their algorithms have a total communication cost of O(k log 2 n/ǫ) and O(k log u/ǫ), respectively, w ..."

Abstract
- Add to MetaCart

We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shrivastava et al. [21]. Their

*algorithms*have a total communication cost of O(k log 2 n/ǫ) and O(k log u/ǫ), respectively###
*Nonnumerical* *Algorithms* and Problems—Sequencing and

"... We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the mu ..."

Abstract
- Add to MetaCart

We consider offline scheduling

*algorithms*that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time*algorithms*to compute all non-dominated solutions for the general uniprocessor problem###
*Nonnumerical* *Algorithms* and Problems

"... In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtual coordinates, rather than real coordinates. In this paper, we address the problem of obtaining virtual coordinates based ..."

Abstract
- Add to MetaCart

based on connectivity information. In particular, we propose the first approximation

*algorithm*for this problem and discuss implementational aspects.###
*Nonnumerical* *Algorithms* and Problems

"... Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to solve SCF problems, and thus be employed for the automated assem ..."

Abstract
- Add to MetaCart

assembly of supply chains of agents. In this paper we present MMUCATS, a test suite for MMUCAs that allows researchers to test, compare, and improve their winner determination

*algorithms*for MMUCAs.###
*Nonnumerical* *Algorithms* and Problems

"... We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k players, each holding a counter ni that gets incremented over time, and the goal is to track an ε-approximation of their ..."

Abstract
- Add to MetaCart

/ε · log N). Our

*algorithm*is simple and uses only O(1) space at each player, while the lower bound holds even assuming each player has infinite computing power. Then, we extend our techniques to two related distributed tracking problems: frequency-tracking and rank-tracking, and obtain similar###
*Nonnumerical* *Algorithms* and Problems

"... We propose and study a new class of online problems, which we call online tracking. Suppose an observer, say Alice, observes a multi-valued function f: Z + → Z d over time in an online fashion, i.e., she only sees f(t) for t ≤ tnow where tnow is the current time. She would like to keep a tracker, sa ..."

Abstract
- Add to MetaCart

, say Bob, informed of the current value of f at all times. Under this setting, Alice could send new values of f to Bob from time to time, so that the current value of f is always within a distance of ∆ to the last value received by Bob. We give competitive online

*algorithms*whose communication costs###
*Nonnumerical* *Algorithms* and Problems—Geometrical

"... We show that unless NP = RP, it is hard to (even) weakly PAC-learn intersection of two halfspaces in R n using a hypothesis which is a function of up to ℓ linear threshold functions for any integer ℓ. Specifically, we show that for every integer ℓ and an arbitrarily small constant ε> 0, unless NP ..."

Abstract
- Add to MetaCart

NP = RP, no polynomial time

*algorithm*can distinguish whether there is an intersection of two halfspaces that correctly classifies a given set of labeled points in R n, or whether any function of ℓ linear threshold functions can correctly classify at most 1 2 + ε fraction of the points. Categories###
*Nonnumerical* *Algorithms* and Problems—Sequencing

, 2013

"... We consider a task graph to be executed on a set of processors. We assume that the mapping is given, say by an ordered list of tasks to execute on each processor, and we aim at optimizing the energy consumption while enforcing a prescribed bound on the execution time. While it is not possible to cha ..."

Abstract
- Add to MetaCart

to change the allocation of a task, it is possible to change its speed. We study the complexity of the problem for different models: continuous speeds, discrete modes, distributed either arbitrarily or regularly, and VDD-hopping. Categories and Subject Descriptors F.2.2 [Analysis of

*algorithms*and problem