539 search results - page 34 / 108 » Recurrence relations and fast algorithms |
161
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
112
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
111
click to vote
SSDBM
2005
IEEE
15 years 7 months ago
2005
IEEE
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
134
click to vote
CIKM
1998
Springer
15 years 6 months ago
1998
Springer
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
ICSE
2003
IEEE-ACM
16 years 2 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...