Sciweavers

4281 search results - page 750 / 857
» How to Disembed a Program
Sort
View
ICML
2008
IEEE
14 years 11 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
14 years 11 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
ICML
2005
IEEE
14 years 11 months ago
Learning the structure of Markov logic networks
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this pap...
Stanley Kok, Pedro Domingos
ICSE
2008
IEEE-ACM
14 years 11 months ago
Granularity in software product lines
Building software product lines (SPLs) with features is a challenging task. Many SPL implementations support features with coarse granularity ? e.g., the ability to add and wrap e...
Christian Kästner, Martin Kuhlemann, Sven Ape...
SIGSOFT
2008
ACM
14 years 11 months ago
Why do developers neglect exception handling?
In this paper, we explore the problems associated with exception handling from a new dimension: the human. We designed a study that evaluates (1) different perspectives of softwar...
Carsten Görg, Hina Shah, Mary Jean Harrold