Sciweavers

3238 search results - page 525 / 648
» Multi-return function call
Sort
View
VLDB
1998
ACM
105views Database» more  VLDB 1998»
15 years 2 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
CODES
1996
IEEE
15 years 2 months ago
A Multi-Level Transformation Approach to HW/SW Codesign: A Case Study
This reported work applies a transformational synthesis approach to hardware/software codesign. In this approach, the process of algorithm design is coupled early on with hardware...
Tommy King-Yin Cheung, Graham R. Hellestrand, Pras...
HICSS
1994
IEEE
152views Biometrics» more  HICSS 1994»
15 years 2 months ago
Simple COMA Node Implementations
Shared memory architectures often have caches to reduce the number of slow remote memory accesses. The largest possible caches exist in shared memory architectures called Cache-On...
Erik Hagersten, Ashley Saulsbury, Anders Landin
CHI
1994
ACM
15 years 2 months ago
Using aggregation and dynamic queries for exploring large data sets
When working with large data sets, users perform three primary types of activities: data manipulation, data analysis, and data visualization. The data manipulation process involve...
Jade Goldstein, Steven F. Roth
ACISP
2009
Springer
15 years 2 months ago
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
Abstract. We establish a framework for bounding the efficiency of cryptographic reductions in terms of their security transfer. While efficiency bounds for the reductions have been...
Ahto Buldas, Aivo Jürgenson, Margus Niitsoo