Sciweavers

33 search results - page 2 / 7
» An empirical study of security problem reports in Linux dist...
Sort
View
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 6 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
ISSTA
2012
ACM
11 years 7 months ago
A quantitative study of accuracy in system call-based malware detection
Over the last decade, there has been a significant increase in the number and sophistication of malware-related attacks and infections. Many detection techniques have been propos...
Davide Canali, Andrea Lanzi, Davide Balzarotti, Ch...
WISEC
2009
ACM
14 years 6 days ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
SSD
2007
Springer
176views Database» more  SSD 2007»
13 years 11 months ago
Distributed, Concurrent Range Monitoring of Spatial-Network Constrained Mobile Objects
The ability to continuously monitor the positions of mobile objects is important in many applications. While most past work has been set in Euclidean spaces, the mobile objects rel...
Hua Lu, Zhiyong Huang, Christian S. Jensen, Linhao...
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 5 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh