2498 search results - page 43 / 500 » Data Structures with Unpredictable Timing |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
VLSID
2000
IEEE
15 years 2 months ago
2000
IEEE
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
118
click to vote
PPOPP
2011
ACM
14 years 17 days ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
IDEAL
2004
Springer
15 years 3 months ago
2004
Springer
Many time series exhibit dynamics over vastly different time scales. The standard way to capture this behavior is to assume that the slow dynamics are a “trend”, to de-trend t...
CDB
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...