1837 search results - page 208 / 368 » Learning From Ambiguous Examples |
268
click to vote
FASE
2011
Springer
14 years 9 months ago
2011
Springer
Probabilistic verification techniques have been applied to the formal modelling and analysis of a wide range of systems, from communication protocols such as Bluetooth, to nanosca...
181
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...
98
Voted
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
— Boolean Satistifiability has attracted tremendous research effort in recent years, resulting in the developments of various efficient SAT solver packages. Based upon their de...
258
click to vote
TSE
2010
15 years 4 months ago
2010
—In this paper, we explore the concept of code readability and investigate its relation to software quality. With data collected from 120 human annotators, we derive associations...
190
click to vote
JMLR
2010
15 years 1 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...