Sciweavers

2006 search results - page 165 / 402
» Heuristic Security-Testing Methods
Sort
View
NPL
2008
63views more  NPL 2008»
15 years 1 months ago
New Routes from Minimal Approximation Error to Principal Components
We introduce two new methods of deriving the classical PCA in the framework of minimizing the mean square error upon performing a lower-dimensional approximation of the data. These...
Abhilash Alexander Miranda, Yann-Aël Le Borgn...
TKDE
2002
127views more  TKDE 2002»
15 years 21 days ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
87
Voted
VSTTE
2010
Springer
14 years 11 months ago
To Goto Where No Statement Has Gone Before
Abstract. This paper presents a method for deriving an expression from the lowlevel code compiled from an expression in a high-level language. The input is a low-level control flo...
Michael Barnett, K. Rustan M. Leino
98
Voted
TKDE
2011
472views more  TKDE 2011»
14 years 8 months ago
Anonymous Publication of Sensitive Transactional Data
Abstract—Existing research on privacy-preserving data publishing focuses on relational data: in this context, the objective is to enforce privacy-preserving paradigms, such as k-...
Gabriel Ghinita, Panos Kalnis, Yufei Tao
130
Voted
ICASSP
2011
IEEE
14 years 4 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...