417 search results - page 77 / 84 » Running Time Predictions for Factoring Algorithms |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
SIGIR
2010
ACM
15 years 1 months ago
2010
ACM
The collective contributions of billions of users across the globe each day result in an ever-changing web. In verticals like news and real-time search, recency is an obvious sign...
111
click to vote
BMCBI
2010
14 years 9 months ago
2010
Background: Mathematical modeling is being applied to increasingly complex biological systems and datasets; however, the process of analyzing and calibrating against experimental ...
IEEEPACT
1998
IEEE
15 years 1 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...