Sciweavers

7167 search results - page 1153 / 1434
» Answer Set Programming
Sort
View
117
Voted
ICML
2008
IEEE
16 years 3 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
ICML
2006
IEEE
16 years 3 months ago
Constructing informative priors using transfer learning
Many applications of supervised learning require good generalization from limited labeled data. In the Bayesian setting, we can try to achieve this goal by using an informative pr...
Rajat Raina, Andrew Y. Ng, Daphne Koller
131
Voted
ICML
2006
IEEE
16 years 3 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
131
Voted
ICSE
2009
IEEE-ACM
16 years 3 months ago
How we refactor, and how we know it
Much of what we know about how programmers refactor in the wild is based on studies that examine just a few software projects. Researchers have rarely taken the time to replicate ...
Emerson R. Murphy-Hill, Chris Parnin, Andrew P. Bl...
SIGSOFT
2008
ACM
16 years 3 months ago
Automated identification of parameter mismatches in web applications
Quality assurance techniques for web applications have become increasingly important as web applications have gained in popularity and become an essential part of our daily lives....
William G. J. Halfond, Alessandro Orso
« Prev « First page 1153 / 1434 Last » Next »