ESA
2003
Springer
13 years 10 months ago
2003
Springer
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
ESA
2003
Springer
13 years 10 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We study auctions in which bidders have severe constraints on the size of messages they are allowed to send to the auctioneer. In such auctions, each bidder has a set of k possible...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We consider the transmission of a movie over a broadcast network to support several viewers who start watching at arbitrary times, after a wait of at most twait minutes. A recent a...