Sciweavers

4171 search results - page 458 / 835
» Choice numbers of graphs
Sort
View
288
Voted
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
16 years 8 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
16 years 8 months ago
Parallel Algorithms for Computing Temporal Aggregates
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advan...
Jose Alvin G. Gendrano, Bruce C. Huang, Jim M. Rod...
DAC
1999
ACM
16 years 7 months ago
Memory Exploration for Low Power, Embedded Systems
In embedded system design, the designer has to choose an onchip memory configuration that is suitable for a specific application. To aid in this design choice, we present a memory...
Wen-Tsong Shiue, Chaitali Chakrabarti
ICML
2002
IEEE
16 years 7 months ago
Exact model averaging with naive Bayesian classifiers
The naive classifier is a well-established mathematical model whose simplicity, speed and accuracy have made it a popular choice for classification in AI and engineering. In this ...
Denver Dash, Gregory F. Cooper
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 7 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu