2107 search results - page 111 / 422 » Computing Small Search Numbers in Linear Time |
127
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
134
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
110
click to vote
SIAMSC
2008
15 years 3 months ago
2008
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
140
click to vote
COLT
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
118
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...