2745 search results - page 326 / 549 » A fast algorithm for computing large Fibonacci numbers |
144
click to vote
MMAS
2004
Springer
15 years 11 months ago
2004
Springer
Demand Bus System, a new public transportation system, is expected to be a convenient service for special transportation demands to solve more and more serious traffic problems con...
191
click to vote
HPCC
2011
Springer
14 years 5 months ago
2011
Springer
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
192
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
117
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Compared with on-chip routers, the existing commercial tools for off-chip routing have a much lower routability and often result in a large number of unrouted nets for manual rout...
145
click to vote
ICCV
2005
IEEE
15 years 12 months ago
2005
IEEE
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...