Sciweavers

1414 search results - page 135 / 283
» Randomness and Universal Machines
Sort
View
130
Voted
AI
2006
Springer
15 years 22 days ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
RAID
2007
Springer
15 years 6 months ago
Vortex: Enabling Cooperative Selective Wormholing for Network Security Systems
We present a novel approach to remote traffic aggregation for Network Intrusion Detection Systems (NIDS) called Cooperative Selective Wormholing (CSW). Our approach works by select...
John R. Lange, Peter A. Dinda, Fabián E. Bu...
EUROCAST
2001
Springer
106views Hardware» more  EUROCAST 2001»
15 years 5 months ago
On CAST.FSM Computation of Hierarchical Multi-layer Networks of Automata
CAST.FSM denotes a CAST tool which has been developed at the Institute of Systems Science at the University of Linz during the years 1986-1993. The first version of CAST.FSM was i...
Michael Affenzeller, Franz Pichler, Rudolf Mittelm...
IADIS
2004
15 years 2 months ago
Detecting Unauthorized Use in Online Journal Archives: A Case Study
JSTOR is a not-for-profit online library containing a full back-run of digitized versions of a large number of academic journals. In order to help defray costs for maintaining the...
Paul Seligman, Sean W. Smith
83
Voted
ENTCS
2002
114views more  ENTCS 2002»
15 years 14 days ago
Adjunction Models For Call-By-Push-Value With Stacks
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
Paul Blain Levy