Sciweavers

96 search results - page 19 / 20
» Improving the efficiency of dynamic malware analysis
Sort
View
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 5 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
TCS
2008
13 years 5 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
SDM
2004
SIAM
211views Data Mining» more  SDM 2004»
13 years 6 months ago
Using Support Vector Machines for Classifying Large Sets of Multi-Represented Objects
Databases are a key technology for molecular biology which is a very data intensive discipline. Since molecular biological databases are rather heterogeneous, unification and data...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
GEOINFO
2004
13 years 6 months ago
Parallel Volume Rendering for Ocean Visualization in a Cluster of PCs
Volume rendering techniques can be very useful in geographical information systems to provide meaningful and visual information about the surface and the interior of 3D datasets. ...
Alexandre Coelho, Marcio Nascimento, Cristiana Ben...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 5 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer