494 search results - page 67 / 99 » Heap Building Bounds |
APWEB
2004
Springer
15 years 4 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
106
click to vote
VLDB
2004
ACM
15 years 4 months ago
2004
ACM
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
SSDBM
2003
IEEE
15 years 4 months ago
2003
IEEE
Although traditional databases and data warehouses have been exploited widely to manage persistent data, a large number of applications from sensor network need functional support...
92
Voted
ISPD
2003
ACM
15 years 4 months ago
2003
ACM
This paper presents a new timing driven force directed placement algorithm that meets physical net length constraints as well as constraints on specific pin sets. It is the first ...
CRYPTO
2003
Springer
15 years 4 months ago
2003
Springer
Can you guarantee secrecy even if an adversary can eavesdrop on your brain? We consider the problem of protecting privacy in circuits, when faced with an adversary that can access ...