2899 search results - page 205 / 580 » Dynamic Trees in Practice |
152
Voted
ESAW
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Exceptions occur frequently in supply-chains. Consequently, detecting exceptions timely is of great practical value. To enable a timely detection of exceptions, this pape...
143
click to vote
SODA
1997
ACM
15 years 6 months ago
1997
ACM
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
174
Voted
STACS
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
185
click to vote
PODS
1994
ACM
15 years 9 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
154
click to vote
DCOSS
2010
Springer
15 years 8 months ago
2010
Springer
Traditional deployments of wireless sensor networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, su...