Sciweavers

5606 search results - page 465 / 1122
» Randomization Techniques for Graphs.
Sort
View
CCS
2003
ACM
16 years 21 hour ago
Learning attack strategies from intrusion alerts
Understanding the strategies of attacks is crucial for security applications such as computer and network forensics, intrusion response, and prevention of future attacks. This pap...
Peng Ning, Dingbang Xu
MICRO
2006
IEEE
100views Hardware» more  MICRO 2006»
16 years 24 days ago
Serialization-Aware Mini-Graphs: Performance with Fewer Resources
Instruction aggregation—the grouping of multiple operations into a single processing unit—is a technique that has recently been used to amplify the bandwidth and capacity of c...
Anne Bracy, Amir Roth
SAT
2009
Springer
117views Hardware» more  SAT 2009»
16 years 1 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
16 years 7 months ago
A new scheme on privacy-preserving data classification
We address privacy-preserving classification problem in a distributed system. Randomization has been the approach proposed to preserve privacy in such scenario. However, this appr...
Nan Zhang 0004, Shengquan Wang, Wei Zhao
ASPDAC
2009
ACM
164views Hardware» more  ASPDAC 2009»
16 years 1 months ago
Accounting for non-linear dependence using function driven component analysis
Majority of practical multivariate statistical analyses and optimizations model interdependence among random variables in terms of the linear correlation among them. Though linear...
Lerong Cheng, Puneet Gupta, Lei He