Sciweavers

1057 search results - page 70 / 212
» Theoretical and Experimental DNA Computation
Sort
View
SPIN
2010
Springer
14 years 8 months ago
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
Alexander Linden, Pierre Wolper
BMCBI
2007
115views more  BMCBI 2007»
14 years 9 months ago
A novel, fast, HMM-with-Duration implementation - for application with a new, pattern recognition informed, nanopore detector
Background: Hidden Markov Models (HMMs) provide an excellent means for structure identification and feature extraction on stochastic sequential data. An HMM-with-Duration (HMMwD) ...
Stephen Winters-Hilt, Carl Baribault
ECCV
2002
Springer
15 years 11 months ago
A Tale of Two Classifiers: SNoW vs. SVM in Visual Recognition
Numerous statistical learning methods have been developed for visual recognition tasks. Few attempts, however, have been made to address theoretical issues, and in particular, stud...
Ming-Hsuan Yang, Dan Roth, Narendra Ahuja
ACMSE
2008
ACM
14 years 11 months ago
Studio-based learning in CS2: an experience report
Recently there has been a surge of interest in making computer science education attractive to potential students, motivating to current students, and relevant to graduating stude...
Lakshman Myneni, Margaret Ross, T. Dean Hendrix, N...
BMCBI
2007
265views more  BMCBI 2007»
14 years 10 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...