9532 search results - page 1637 / 1907 » Logic, Graphs, and Algorithms |
187
click to vote
CIAC
2000
Springer
15 years 11 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
201
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
176
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a theoretical study of decentralized control for sensing-based shape formation on modular multirobot systems, where the desired shape is specified in terms of ...
195
click to vote
NIPS
2000
15 years 8 months ago
2000
In an important recent paper, Yedidia, Freeman, and Weiss [11] showed that there is a close connection between the belief propagation algorithm for probabilistic inference and the...
201
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...