417 search results - page 6 / 84 » Running Time Predictions for Factoring Algorithms |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
SIGSOFT
2006
ACM
15 years 10 months ago
2006
ACM
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
JC
2007
14 years 9 months ago
2007
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
BMCBI
2006
14 years 9 months ago
2006
Background: Expression array data are used to predict biological functions of uncharacterized genes by comparing their expression profiles to those of characterized genes. While b...
NIPS
2003
14 years 11 months ago
2003
We interpret non-negative matrix factorization geometrically, as the problem of finding a simplicial cone which contains a cloud of data points and which is contained in the posi...