Sciweavers

302 search results - page 14 / 61
» Efficient Algorithms for the Longest Path Problem
Sort
View
71
Voted
TCBB
2008
113views more  TCBB 2008»
14 years 9 months ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Alexander Schliep, Roland Krause
105
Voted
JCIT
2010
115views more  JCIT 2010»
14 years 4 months ago
The Recognition Method of Unknown Chinese Words in Fragments Based on Mutual Information
This paper presents a method of using mutual information to improve the recognition algorithm of unknown Chinese words, it can resolve the complexity of weight settings and the in...
Qian Zhu, Xian-Yi Cheng, Zi-juan Gao
COCOON
2006
Springer
15 years 1 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
14 years 7 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...
TC
1998
14 years 9 months ago
Resilient Authentication Using Path Independence
—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distribut...
Michael K. Reiter, Stuart G. Stubblebine