Sciweavers

149 search results - page 22 / 30
» The Longest Path Problem Is Polynomial on Interval Graphs
Sort
View
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
14 years 3 days ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...
ACSAC
2003
IEEE
14 years 1 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
RECOMB
2010
Springer
14 years 3 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 8 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
14 years 1 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...