4325 search results - page 12 / 865 » Incremental computation with names |
42
Voted
ISCAS
2007
IEEE
15 years 4 months ago
2007
IEEE
— Sphere decoding enables maximum likelihood (ML) detection with lower complexity than other decoding algorithms, but it still suffers from large computational delay. This paper ...
SIGGRAPH
1989
ACM
15 years 2 months ago
1989
ACM
AIPS
2004
14 years 12 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
WAW
2004
Springer
15 years 3 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
178
click to vote
ICDE
2001
IEEE
15 years 12 months ago
2001
IEEE
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is partic...