Sciweavers

990 search results - page 143 / 198
» An efficient data structure for network anomaly detection
Sort
View
LCN
2008
IEEE
14 years 2 months ago
P2P directory search: Signature Array Hash Table
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
Miguel Jimeno, Kenneth J. Christensen
ENTCS
2008
105views more  ENTCS 2008»
13 years 8 months ago
Checking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Tobias Blechmann, Christel Baier
VTC
2008
IEEE
185views Communications» more  VTC 2008»
14 years 2 months ago
Opportunistic Spectrum Access for Energy-Constrained Cognitive Radios
This paper considers a scenario in which a secondary user makes opportunistic use of a channel allocated to some primary network. The primary network operates in a time-slotted ma...
Anh Tuan Hoang, Ying-Chang Liang, David Tung Chong...
BMCBI
2007
154views more  BMCBI 2007»
13 years 8 months ago
Inferring biological networks with output kernel trees
Background: Elucidating biological networks between proteins appears nowadays as one of the most important challenges in systems biology. Computational approaches to this problem ...
Pierre Geurts, Nizar Touleimat, Marie Dutreix, Flo...
ECAI
2010
Springer
13 years 8 months ago
Mining Outliers with Adaptive Cutoff Update and Space Utilization (RACAS)
Recently the efficiency of an outlier detection algorithm ORCA was improved by RCS (Randomization with faster Cutoff update and Space utilization after pruning), which changes the ...
Chi-Cheong Szeto, Edward Hung