Sciweavers

406 search results - page 62 / 82
» Identifying Codes and Covering Problems
Sort
View
BMCBI
2006
119views more  BMCBI 2006»
13 years 8 months ago
Hidden Markov Model Variants and their Application
Markov statistical methods may make it possible to develop an unsupervised learning process that can automatically identify genomic structure in prokaryotes in a comprehensive way...
Stephen Winters-Hilt

Book
778views
15 years 6 months ago
Gaussian Processes for Machine Learning
"Gaussian processes (GPs) provide a principled, practical, probabilistic approach to learning in kernel machines. GPs have received increased attention in the machine-learning...
Carl Edward Rasmussen and Christopher K. I. Willia...
PEPM
2009
ACM
14 years 5 months ago
Bidirectional data-flow analyses, type-systematically
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
Maria João Frade, Ando Saabas, Tarmo Uustal...
FASE
2006
Springer
14 years 8 days ago
: Designing a Scalable Build Process
Modern software codebases are frequently large, heterogeneous, and constantly evolving. The languages and tools for software construction, including code builds and configuration m...
Jason Hickey, Aleksey Nogin
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 9 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang