Sciweavers

362 search results - page 43 / 73
» Finding Motifs with Gaps
Sort
View
142
Voted
DATE
1999
IEEE
95views Hardware» more  DATE 1999»
15 years 9 months ago
Object-Oriented Reuse Methodology for VHDL
In the reuse domain, the necessity of finding a new, more suitable description language opposes the need to make reuse an accepted practice, and thus related to standards. This pa...
Cristina Barna, Wolfgang Rosenstiel
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
15 years 9 months ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...
CLUSTER
2004
IEEE
15 years 9 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...
APN
2000
Springer
15 years 9 months ago
Woflan 2.0: A Petri-Net-Based Workflow Diagnosis Tool
Abstract. Workflow management technology promises a flexible solution facilitating the easy creation of new business processes and modification of existing ones. Unfortunately, mos...
H. M. W. (Eric) Verbeek, Wil M. P. van der Aalst
EUROPAR
2008
Springer
15 years 7 months ago
Mapping Heterogeneous Distributed Applications on Clusters
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
Sylvain Jubertie, Emmanuel Melin, Jér&eacut...