Sciweavers

572 search results - page 79 / 115
» Isotonic Classification Trees
Sort
View
DAM
2010
81views more  DAM 2010»
13 years 8 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon
SIAMDM
2008
139views more  SIAMDM 2008»
13 years 8 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
VIROLOGY
2008
104views more  VIROLOGY 2008»
13 years 8 months ago
Malware behaviour analysis
Several malware analysis techniques suppose that the disassembled code of a piece of malware is available, which is however not always possible. This paper proposes a flexible and ...
Gérard Wagener, Radu State, Alexandre Dulau...
TACS
1994
Springer
14 years 26 days ago
Syntactic Definitions of Undefined: On Defining the Undefined
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
Zena M. Ariola, Richard Kennaway, Jan Willem Klop,...
CCS
2007
ACM
14 years 3 months ago
Defining categories to select representative attack test-cases
To ameliorate the quality of protection provided by intrusion detection systems (IDS) we strongly need more effective evaluation and testing procedures. Evaluating an IDS against ...
Mohammed S. Gadelrab, Anas Abou El Kalam, Yves Des...