406 search results - page 53 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
150
click to vote
ICDCS
1991
IEEE
15 years 9 months ago
1991
IEEE
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
137
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The paper presents the position analysis of a spatial structure composed of two platforms mutually connected by one RRP and three SS serial kinematic chains, where R, P, and S sta...
184
click to vote
PAMI
2007
15 years 5 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
154
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
160
click to vote
DSN
2007
IEEE
16 years 8 days ago
2007
IEEE
While the new generation of hand-held devices, e.g., smart phones, support a rich set of applications, growing complexity of the hardware and runtime environment makes the devices...