100 search results - page 9 / 20 » Fast Approximate Energy Minimization with Label Costs |
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Because of the large variation across different environments, a generic classifier trained on extensive data-sets may perform sub-optimally in a particular test environment. In th...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
WABI
2009
Springer
14 years 3 months ago
2009
Springer
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...