2745 search results - page 347 / 549 » A fast algorithm for computing large Fibonacci numbers |
167
Voted
BMCBI
2006
15 years 6 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
235
click to vote
DSN
2011
IEEE
14 years 6 months ago
2011
IEEE
Phase change memory (PCM) has emerged as a promising technology for main memory due to many advan tages, such as better scalability, non-volatility and fast read access. However,...
169
click to vote
CGF
2006
15 years 6 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
223
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
201
click to vote
SIGCOMM
2012
ACM
13 years 8 months ago
2012
ACM
We consider a system of compute and storage resources geographically distributed over a large number of locations connected via a wide-area network. By distributing the resources,...