2745 search results - page 397 / 549 » A fast algorithm for computing large Fibonacci numbers |
148
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
We present a class of richly structured, undirected hidden variable models suitable for simultaneously modeling text along with other attributes encoded in different modalities. O...
159
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: The ever-increasing wealth of genomic sequence information provides an unprecedented opportunity for large-scale phylogenetic analysis. However, species phylogeny infe...
163
click to vote
CASES
2003
ACM
15 years 10 months ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
146
Voted
TON
2010
15 years 3 months ago
2010
—This paper develops a simple and accurate stochastic model for the steady-state throughput of a TCP NewReno bulk data transfer as a function of round-trip time and loss rate. Ou...
156
click to vote
IACR
2011
14 years 4 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...