256 search results - page 25 / 52 » Short trees in polygons |
ASPDAC
2006
ACM
14 years 2 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
ACL
2009
13 years 6 months ago
2009
Articles in the Penn TreeBank were identified as being reviews, summaries, letters to the editor, news reportage, corrections, wit and short verse, or quarterly profit reports. Al...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We present a model of a `gas of circles', the ensemble of regions in the image domain consisting of an unknown number of circles with approximately fixed radius and short ran...
EWSN
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. In-network data aggregation is widely recognized as an acceptable means to reduce the amount of transmitted data without adversely affecting the quality of the results. T...
CAAN
2006
Springer
14 years 12 days ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...