Sciweavers

1106 search results - page 185 / 222
» On regularization algorithms in learning theory
Sort
View
POPL
2007
ACM
16 years 4 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
BMCBI
2005
100views more  BMCBI 2005»
15 years 4 months ago
Speeding disease gene discovery by sequence based candidate prioritization
Background: Regions of interest identified through genetic linkage studies regularly exceed 30 centimorgans in size and can contain hundreds of genes. Traditionally this number is...
Euan A. Adie, Richard R. Adams, Kathryn L. Evans, ...
JACM
2006
99views more  JACM 2006»
15 years 4 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
ECML
2007
Springer
15 years 10 months ago
Stability Based Sparse LSI/PCA: Incorporating Feature Selection in LSI and PCA
The stability of sample based algorithms is a concept commonly used for parameter tuning and validity assessment. In this paper we focus on two well studied algorithms, LSI and PCA...
Dimitrios Mavroeidis, Michalis Vazirgiannis
SIGIR
2005
ACM
15 years 9 months ago
On the collective classification of email "speech acts"
We consider classification of email messages as to whether or not they contain certain “email acts”, such as a request or a commitment. We show that exploiting the sequential ...
Vitor Rocha de Carvalho, William W. Cohen