Sciweavers

2745 search results - page 385 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ISCAS
2003
IEEE
131views Hardware» more  ISCAS 2003»
15 years 10 months ago
Process variation dimension reduction based on SVD
We propose an algorithm based on singular value decomposition (SVD) to reduce the number of process variation variables. With few process variation variables, fault simulation and...
Zhuo Li, Xiang Lu, Weiping Shi
ADHOCNOW
2004
Springer
15 years 10 months ago
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Mike Burmester, Tri Van Le, Alec Yasinsac
DICTA
2007
15 years 6 months ago
Efficient Image Processing with the Apply Language
Apply is a Domain-Specific Language for image processing and low-level computer vision. Apply allows programmers to write kernel operations that focus on the computation for a sin...
Leonard G. C. Hamey
ICPR
2008
IEEE
16 years 6 months ago
EK-SVD: Optimized dictionary design for sparse representations
Sparse representations using overcomplete dictionaries are used in a variety of field such as pattern recognition and compression. However, the size of dictionary is usually a tra...
Raazia Mazhar, Paul D. Gader
ACSC
2004
IEEE
15 years 8 months ago
Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...
Carsten Friedrich, Falk Schreiber