1632 search results - page 126 / 327 » Sublinear Time Algorithms for Metric Space Problems |
171
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
135
click to vote
TCS
1998
15 years 3 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
141
Voted
SIAMCOMP
2010
14 years 10 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
142
Voted
PODS
2005
ACM
16 years 3 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
147
Voted
RT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we present a new shadow mapping technique that improves upon the quality of perspective and uniform shadow maps. Our technique uses a perspective transform specifi...