303 search results - page 31 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
IWCIA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
PDPTA
2004
13 years 10 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
PPOPP
2010
ACM
13 years 10 months ago
2010
ACM
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...