Sciweavers

256 search results - page 34 / 52
» Short trees in polygons
Sort
View
DAC
2006
ACM
15 years 3 months ago
Steiner network construction for timing critical nets
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...
Shiyan Hu, Qiuyang Li, Jiang Hu, Peng Li
CEC
2010
IEEE
15 years 26 days ago
Evolving natural language grammars without supervision
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...
Lourdes Araujo, Jesus Santamaria
ISBI
2011
IEEE
14 years 3 months ago
Reliable cell tracking by global data association
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...
Ryoma Bise, Zhaozheng Yin, Takeo Kanade
PKC
2009
Springer
142views Cryptology» more  PKC 2009»
16 years 9 days ago
Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures
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...
Brian J. Matt
NN
2006
Springer
14 years 11 months ago
Self-organizing neural networks to support the discovery of DNA-binding motifs
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...
Shaun Mahony, Panayiotis V. Benos, Terry J. Smith,...