417 search results - page 25 / 84 » Running Time Predictions for Factoring Algorithms |
133
Voted
RECOMB
2010
Springer
15 years 1 months ago
2010
Springer
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
109
Voted
CORR
2010
Springer
15 years 28 days ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
132
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
The aggregation and comparison of behavioral patterns on the WWW represent a tremendous opportunity for understanding past behaviors and predicting future behaviors. In this paper...
124
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
133
Voted
SIGMETRICS
2002
ACM
15 years 3 months ago
2002
ACM
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived closed form solution is applicable to class of greedy algorithms that include a va...