Sciweavers

10602 search results - page 150 / 2121
» Weakly Useful Sequences
Sort
View
BMCBI
2005
106views more  BMCBI 2005»
15 years 3 months ago
SIMPROT: Using an empirically determined indel distribution in simulations of protein evolution
Background: General protein evolution models help determine the baseline expectations for the evolution of sequences, and they have been extensively useful in sequence analysis an...
Andy Pang, Andrew D. Smith, Paulo A. S. Nuin, Elis...
CVPR
2006
IEEE
16 years 6 months ago
Gesture Recognition using Hidden Markov Models from Fragmented Observations
We consider the problem of computing the likelihood of a gesture from regular, unaided video sequences, without relying on perfect segmentation of the scene. Instead of requiring ...
Ruiduo Yang, Sudeep Sarkar
BMCBI
2007
135views more  BMCBI 2007»
15 years 4 months ago
RECOVIR: An application package to automatically identify some single stranded RNA viruses using capsid protein residues that un
Background: Most single stranded RNA (ssRNA) viruses mutate rapidly to generate large number of strains having highly divergent capsid sequences. Accurate strain recognition in un...
Dianhui Zhu, George E. Fox, Sugoto Chakravarty
HIS
2004
15 years 5 months ago
Adaptive Boosting with Leader based Learners for Classification of Large Handwritten Data
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...
DAC
2001
ACM
16 years 5 months ago
Improved Cut Sequences for Partitioning Based Placement
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
Mehmet Can Yildiz, Patrick H. Madden