Sciweavers

7 search results - page 2 / 2
» faw 2009
Sort
View
FAW
2009
Springer
118views Algorithms» more  FAW 2009»
15 years 7 months ago
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Mostafa Nouri, Mohammad Ghodsi
152
Voted
FOCS
2009
IEEE
15 years 10 months ago
The Data Stream Space Complexity of Cascaded Norms
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
T. S. Jayram, David P. Woodruff