Sciweavers

1067 search results - page 103 / 214
» Probabilistic regular graphs
Sort
View
JAIR
1998
92views more  JAIR 1998»
15 years 2 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
15 years 3 months ago
Airy Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
Philippe Flajolet, Bruno Salvy, Gilles Schaeffer
DSN
2000
IEEE
15 years 7 months ago
Benchmarking Anomaly-Based Detection Systems
Anomaly detection is a key element of intrusiondetection and other detection systems in which perturbations of normal behavior suggest the presence of intentionally or unintention...
Roy A. Maxion, Kymie M. C. Tan
WSC
2008
15 years 5 months ago
A multi threaded and resolution approach to simulated futures evaluation
As part of the DARPA Deep Green efforts, SAIC developed a multi-threaded and resolution approach to constructing and evaluating simulated futures to address the SimPath component....
David R. Pratt, Robert W. Franceschini, Robert B. ...
IJAR
2010
152views more  IJAR 2010»
15 years 1 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...