Sciweavers

2219 search results - page 383 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
15 years 3 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
NDSS
2009
IEEE
15 years 9 months ago
Scalable, Behavior-Based Malware Clustering
Anti-malware companies receive thousands of malware samples every day. To process this large quantity, a number of automated analysis tools were developed. These tools execute a m...
Ulrich Bayer, Paolo Milani Comparetti, Clemens Hla...
153
Voted
FPCA
1995
15 years 5 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
SPAA
2012
ACM
13 years 4 months ago
A scalable framework for heterogeneous GPU-based clusters
GPU-based heterogeneous clusters continue to draw attention from vendors and HPC users due to their high energy efficiency and much improved single-node computational performance...
Fengguang Song, Jack Dongarra
AI
2011
Springer
14 years 9 months ago
Learning qualitative models from numerical data
Qualitative models are often a useful abstraction of the physical world. Learning qualitative models from numerical data sible way to obtain such an abstraction. We present a new ...
Jure Zabkar, Martin Mozina, Ivan Bratko, Janez Dem...