2745 search results - page 323 / 549 » A fast algorithm for computing large Fibonacci numbers |
144
click to vote
CEC
2007
IEEE
16 years 15 days ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
150
Voted
DCC
2000
IEEE
15 years 6 months ago
2000
IEEE
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
164
Voted
IOPADS
1996
15 years 7 months ago
1996
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
175
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We develop an algorithm for finding and kinematically tracking multiple people in long sequences. Our basic assumption is that people tend to take on certain canonical poses, even...
162
click to vote
PG
2003
IEEE
15 years 11 months ago
2003
IEEE
We present a novel approach for adaptively grouping and subdividing hair using discrete level-of-detail (LOD) representations. The set of discrete LODs include hair strands, clust...