Sciweavers

209 search results - page 13 / 42
» Using Run-Time Data for Program Comprehension
Sort
View
ICMLA
2003
13 years 9 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
FORTE
2008
13 years 9 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 8 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
WSC
1998
13 years 9 months ago
Parallel Implementation of a Molecular Dynamics Simulation Program
We have taken a NIST molecular dynamics simulation program (md3), which was configured as a single sequential process running on a CRAY C90 vector supercomputer, and parallelized ...
Alan Mink, Christophe Bailly
ESA
2003
Springer
96views Algorithms» more  ESA 2003»
14 years 1 months ago
Streaming Geometric Optimization Using Graphics Hardware
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Must...