2745 search results - page 223 / 549 » A fast algorithm for computing large Fibonacci numbers |
121
click to vote
ATS
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper addresses the problem of locating the stuckopen faults in a manufactured IC with scan flip-flops. Unlike most previous methods that only aim at identifying the faulty s...
139
click to vote
ICSE
2011
IEEE-ACM
14 years 8 months ago
2011
IEEE-ACM
Highly interactive web applications that offer user experience and responsiveness of desktop applications are becoming increasingly popular. They are often composed out of visual...
140
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper proposes a method for constructing a discriminative rotation invariant object recognition system from the set of complex moments by using a multi-class boosting algorit...
142
click to vote
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
140
click to vote
GIAE
2004
Springer
15 years 9 months ago
2004
Springer
For a first order autonomous ODE, we give a polynomial time algorithm to decide whether it has a polynomial general solution and to compute one if it exists. Experiments show that...