Sciweavers

302 search results - page 10 / 61
» Efficient Algorithms for the Longest Path Problem
Sort
View
ICPADS
2006
IEEE
14 years 2 months ago
Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling...
Mohammad I. Daoud, Nawwaf N. Kharma
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
14 years 2 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
RECOMB
2005
Springer
14 years 8 months ago
Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...
Jacob Scott, Trey Ideker, Richard M. Karp, Roded S...
TCAD
2008
75views more  TCAD 2008»
13 years 8 months ago
An Efficient Graph-Based Algorithm for ESD Current Path Analysis
Abstract--The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer-circuit design. High voltages that resulted from ESD might cause high cu...
Chih-Hung Liu, Hung-Yi Liu, Chung-Wei Lin, Szu-Jui...
CCCG
2007
13 years 10 months ago
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
Sören Laue, Domagoj Matijevic