Sciweavers

1068 search results - page 23 / 214
» On Space Bounded Server Algorithms
Sort
View
TAMC
2010
Springer
14 years 20 days ago
Streaming Algorithms for Some Problems in Log-Space
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
Ajesh Babu, Nutan Limaye, Girish Varma
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 8 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ICDT
2009
ACM
148views Database» more  ICDT 2009»
14 years 8 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha
IJRR
2011
174views more  IJRR 2011»
13 years 2 months ago
Bounding on rough terrain with the LittleDog robot
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Upper Bounds on the Computational Power of an Optical Model of Computation
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
Damien Woods