2745 search results - page 409 / 549 » A fast algorithm for computing large Fibonacci numbers |
140
Voted
MM
2006
ACM
15 years 10 months ago
2006
ACM
A large number of videos cannot be visualized on mobile devices (e.g., PDAs or mobile phones) due to an inappropriate color depth of the displays. Important details are lost if th...
140
click to vote
ISQED
2005
IEEE
15 years 10 months ago
2005
IEEE
Hierarchical approach greatly facilitates large-scale chip design by hiding distracting details in low-level objects. However, the lowlevel designs have to have a global view of h...
153
click to vote
DAC
2003
ACM
15 years 10 months ago
2003
ACM
The increasing use of microprocessor cores in embedded systems as well as mobile and portable devices creates an opportunity for customizing the cache subsystem for improved perfo...
132
click to vote
SCALESPACE
1999
Springer
15 years 9 months ago
1999
Springer
Since the work by Osher and Sethian on level-sets algorithms for numerical shape evolutions, this technique has been used for a large number of applications in numerous fields. In...
156
click to vote
DAC
1989
ACM
15 years 8 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...