256 search results - page 34 / 52 » Short trees in polygons |
DAC
2006
ACM
14 years 9 days ago
2006
ACM
Conventionally, signal net routing is almost always implemented as Steiner trees. However, non-tree topology is often superior on timing performance as well as tolerance to open f...
CEC
2010
IEEE
13 years 9 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
ISBI
2011
IEEE
13 years 10 days ago
2011
IEEE
Automated cell tracking in populations is important for research and discovery in biology and medicine. In this paper, we propose a cell tracking method based on global spatiotemp...
PKC
2009
Springer
14 years 9 months ago
2009
Springer
This paper describes new methods in pairing-based signature schemes for identifying the invalid digital signatures in a batch, after batch verification has failed. These methods ef...
NN
2006
Springer
13 years 8 months ago
2006
Springer
Identification of the short DNA sequence motifs that serve as binding targets for transcription factors is an important challenge in bioinformatics. Unsupervised techniques from t...