135 search results - page 24 / 27 » Improved dense multivariate polynomial factorization algorit... |
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
BMCBI
2006
13 years 7 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
The paper introduces a new framework for feature learning in classification motivated by information theory. We first systematically study the information structure and present a n...