2168 search results - page 41 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
ACL
2009
13 years 5 months ago
2009
This paper describes log-linear models for a general-purpose sentence realizer based on dependency structures. Unlike traditional realizers using grammar rules, our method realize...
3DPVT
2002
IEEE
14 years 21 days ago
2002
IEEE
Techniques are presented to progressively approximate and compress in a lossless manner two-colored (i.e. binary) 3D objects (as well as objects of arbitrary dimensionality). The ...
IEEEPACT
2006
IEEE
14 years 1 months ago
2006
IEEE
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
BMCBI
2008
13 years 7 months ago
2008
Background: We consider effects of dependence among variables of high-dimensional data in multiple hypothesis testing problems, in particular the False Discovery Rate (FDR) contro...