Amanote Research
Register
Sign In
Synthesis of Fast Programs for Maximum Segment Sum Problems
doi 10.1145/1621607.1621626
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2009
Authors
Srinivas Nedunuri
William R. Cook
Publisher
ACM Press
Related search
A Fast Heuristic Algorithm for Solving High-Density Subset-Sum Problems
International Journal of Mathematical Sciences and Computing
Programs for Problems
Nature
Multidisciplinary
Maximum-Scoring Segment Sets
IEEE/ACM Transactions on Computational Biology and Bioinformatics
Biotechnology
Applied Mathematics
Genetics
Toward Tractable Global Solutions to Maximum-Likelihood Estimation Problems via Sparse Sum-Of-Squares Relaxations*
A Fast Hough Transform for Segment Detection
IEEE Transactions on Image Processing
Computer Graphics
Computer-Aided Design
Software
Fast Maximum Likelihood Algorithm for Localization of Fluorescent Molecules
Optics Letters
Optics
Atomic
Molecular Physics,
OPtimal Synthesis and Normality of the Maximum Principle for Optimal Control Problems With Pure State Constraints
A Fast Approximation for Maximum Weight Matroid Intersection
On the Maximum Partial Sum of Independent Random Variables
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
