2745 search results - page 365 / 549 » A fast algorithm for computing large Fibonacci numbers |
144
click to vote
IJAIT
2008
15 years 5 months ago
2008
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
173
click to vote
COMGEO
2007
ACM
15 years 5 months ago
2007
ACM
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
170
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
139
Voted
SIGCOMM
2006
ACM
15 years 11 months ago
2006
ACM
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
147
click to vote
RECOMB
2010
Springer
15 years 12 months ago
2010
Springer
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...