Sciweavers

1068 search results - page 81 / 214
» On Space Bounded Server Algorithms
Sort
View
COMPGEOM
1992
ACM
13 years 12 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
JSS
2008
65views more  JSS 2008»
13 years 7 months ago
Process pipeline scheduling
This paper explores how process pipeline scheduling may become a viable strategy for executing workflows. It first details a workflow optimization and execution algorithm that redu...
Melissa Lemos, Marco A. Casanova, Antonio L. Furta...
ML
2008
ACM
13 years 7 months ago
Large margin vs. large volume in transductive learning
Abstract. We consider a large volume principle for transductive learning that prioritizes the transductive equivalence classes according to the volume they occupy in hypothesis spa...
Ran El-Yaniv, Dmitry Pechyony, Vladimir Vapnik
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
13 years 9 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
ANTS
2004
Springer
233views Algorithms» more  ANTS 2004»
14 years 1 months ago
Computing Order Statistics in the Farey Sequence
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
Corina E. Patrascu, Mihai Patrascu