2593 search results - page 152 / 519 » Algorithms and Data Structures for Computer Topology |
198
click to vote
SDM
2011
SIAM
14 years 8 months ago
2011
SIAM
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
104
click to vote
HICSS
1997
IEEE
15 years 9 months ago
1997
IEEE
The mpC language was developed to write efJicientand portable programsfor wide range of distributed memory machines. It supports both task and data parallelism, allows both static...
137
click to vote
SBACPAD
2008
IEEE
15 years 11 months ago
2008
IEEE
The development of grid algorithms is frequently hampered by limited means to describe topologies and lack of support for the invasive composition of legacy components in order to...
165
click to vote
COMGEO
1999
ACM
15 years 4 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
144
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...