Sciweavers

914 search results - page 157 / 183
» Analysis of Heuristic Synergies
Sort
View
KDD
2006
ACM
132views Data Mining» more  KDD 2006»
16 years 6 days ago
Utility-based anonymization using local recoding
Privacy becomes a more and more serious concern in applications involving microdata. Recently, efficient anonymization has attracted much research work. Most of the previous metho...
Jian Xu, Wei Wang 0009, Jian Pei, Xiaoyuan Wang, B...
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 6 days ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos
LCTRTS
2009
Springer
15 years 6 months ago
A compiler optimization to reduce soft errors in register files
Register file (RF) is extremely vulnerable to soft errors, and traditional redundancy based schemes to protect the RF are prohibitive not only because RF is often in the timing c...
Jongeun Lee, Aviral Shrivastava
EMSOFT
2007
Springer
15 years 6 months 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
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
15 years 5 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze