Sciweavers

4908 search results - page 207 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
PRL
2007
180views more  PRL 2007»
15 years 6 months ago
Feature selection based on rough sets and particle swarm optimization
: We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, b...
Xiangyang Wang, Jie Yang, Xiaolong Teng, Weijun Xi...
DAC
2010
ACM
15 years 4 months ago
Tradeoff analysis and optimization of power delivery networks with on-chip voltage regulation
Integrating a large number of on-chip voltage regulators holds the promise of solving many power delivery challenges through strong local load regulation and facilitates systemlev...
Zhiyu Zeng, Xiaoji Ye, Zhuo Feng, Peng Li
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 8 months ago
DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation
This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline quer...
Ping Wu, Divyakant Agrawal, Ömer Egecioglu, A...
EMSOFT
2007
Springer
16 years 22 days ago
Optimal task placement to improve cache performance
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
Gernot Gebhard, Sebastian Altmeyer
PODC
2004
ACM
15 years 12 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...