7006 search results - page 1342 / 1402 » Approximation Algorithms |
107
click to vote
COLT
2010
Springer
14 years 10 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
127
click to vote
EGH
2010
Springer
14 years 10 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
110
Voted
ICCAD
2009
IEEE
14 years 10 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
129
click to vote
BMCBI
2010
14 years 10 months ago
2010
Background: The preprocessing of gene expression data obtained from several platforms routinely includes the aggregation of multiple raw signal intensities to one expression value...
126
click to vote
BCB
2010
14 years 7 months ago
2010
A major bottleneck in high-throughput protein crystallography is producing protein-structure models from an electrondensity map. In previous work, we developed Acmi, a probabilist...