820 search results - page 134 / 164 » Finding low-utility data structures |
CCGRID
2010
IEEE
13 years 9 months ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
DEXA
2010
Springer
13 years 9 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
ACTA
2008
13 years 8 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
BIOSYSTEMS
2008
13 years 8 months ago
2008
Despite several decades of intense study, protein folding problem remains elusive. In this paper, we review current knowledge and the prevailing thinking in the field, and summari...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 8 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...