238 search results - page 19 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
113
click to vote
WEA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
93
Voted
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
DCOSS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...