Sciweavers

990 search results - page 86 / 198
» An efficient data structure for network anomaly detection
Sort
View
AINA
2009
IEEE
14 years 2 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
CIDM
2007
IEEE
14 years 1 days ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ICCD
1991
IEEE
65views Hardware» more  ICCD 1991»
13 years 11 months ago
Self-Timed Logic Using Current-Sensing Completion Detection (CSCD)
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
Mark E. Dean, David L. Dill, Mark Horowitz
PR
2006
78views more  PR 2006»
13 years 8 months ago
Similarity-based analysis for large networks of ultra-low resolution sensors
By analyzing the similarities between bit streams coming from a network of motion detectors, we can recover the network geometry and discover structure in the human behavior being...
Christopher Richard Wren, David C. Minnen, Sriniva...
DCOSS
2008
Springer
13 years 9 months ago
Efficient Node Discovery in Mobile Wireless Sensor Networks
Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to ju...
Vladimir Dyo, Cecilia Mascolo