Sciweavers

12825 search results - page 398 / 2565
» Improved PLSOM algorithm
Sort
View
134
Voted
BMCBI
2008
71views more  BMCBI 2008»
15 years 7 months ago
An improved string composition method for sequence comparison
Background: Historically, two categories of computational algorithms (alignment-based and alignment-free) have been applied to sequence comparison
Guoqing Lu, Shunpu Zhang, Xiang Fang
INFSOF
2006
103views more  INFSOF 2006»
15 years 7 months ago
Improving test quality using robust unique input/output circuit sequences (UIOCs)
In finite state machine (FSM) based testing, the problem of fault masking in the unique input/output (UIO) sequence may degrade the test performance of the UIO based methods. This...
Qiang Guo, Robert M. Hierons, Mark Harman, Karnig ...
CTRSA
2007
Springer
102views Cryptology» more  CTRSA 2007»
15 years 11 months ago
Improved Efficiency for Private Stable Matching
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
15 years 11 months ago
Improving EAs for Sequencing Problems
Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. Howeve...
Wolfgang Günther, Rolf Drechsler
TACAS
2000
Springer
121views Algorithms» more  TACAS 2000»
15 years 11 months ago
Using Static Analysis to Improve Automatic Test Generation
Conformance testing is still the main industrial validation technique for telecommunication protocols. The automatic construction of test cases based on the model approach is hinde...
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu