6365 search results - page 790 / 1273 » Fast Local Computation Algorithms |
217
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
247
click to vote
CPM
2006
Springer
15 years 11 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
211
click to vote
DAGSTUHL
2010
15 years 9 months ago
2010
We present a streaming compression algorithm for huge time-varying aerial imagery. New airborne optical sensors are capable of collecting billion-pixel images at multiple frames p...
184
click to vote
AAAI
2006
15 years 9 months ago
2006
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
205
click to vote
PC
1998
15 years 7 months ago
1998
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems canbe entirely solvedentirely ...