Sciweavers

10988 search results - page 1957 / 2198
» Algorithmic Folding Complexity
Sort
View
JNSM
2008
93views more  JNSM 2008»
15 years 3 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
JOC
2008
92views more  JOC 2008»
15 years 3 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay
JFP
2006
113views more  JFP 2006»
15 years 3 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
JMLR
2006
134views more  JMLR 2006»
15 years 3 months ago
Considering Cost Asymmetry in Learning Classifiers
Receiver Operating Characteristic (ROC) curves are a standard way to display the performance of a set of binary classifiers for all feasible ratios of the costs associated with fa...
Francis R. Bach, David Heckerman, Eric Horvitz
JMLR
2006
124views more  JMLR 2006»
15 years 3 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
« Prev « First page 1957 / 2198 Last » Next »