Sciweavers

20197 search results - page 691 / 4040
» Comparing Computational Power
Sort
View
ICMLA
2003
15 years 8 months ago
Robust Support Vector Machines for Anomaly Detection in Computer Security
— Using the 1998 DARPA BSM data set collected at MIT’s Lincoln Labs to study intrusion detection systems, the performance of robust support vector machines (RVSMs) was compared...
Wenjie Hu, Yihua Liao, V. Rao Vemuri
FTCS
1993
86views more  FTCS 1993»
15 years 8 months ago
Interval Availability Distribution Computation
Interval availability is a dependability measure defined by the fraction of time during which a system is in operation over a finite observation period. The computation of its d...
Gerardo Rubino, Bruno Sericola
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 7 months ago
A distributed file system for a wide-area high performance computing infrastructure
We describe our work in implementing a wide-area distributed file system for the NSF TeraGrid. The system, called XUFS, allows private distributed name spaces to be created for tr...
Edward Walker
ENTCS
2006
137views more  ENTCS 2006»
15 years 7 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
COMPLEXITY
2007
104views more  COMPLEXITY 2007»
15 years 7 months ago
What is the complexity of a distributed computing system?
Distributed computing systems are becoming bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, the...
Anand Ranganathan, Roy H. Campbell