Sciweavers

63 search results - page 5 / 13
» Lookup Tables, Recurrences and Complexity
Sort
View
ICDAR
2011
IEEE
12 years 7 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal
VLSID
2001
IEEE
132views VLSI» more  VLSID 2001»
14 years 8 months ago
Accurate Power Macro-modeling Techniques for Complex RTL Circuits
This paper presents novel techniques for the cycle-accurate power macro-modeling of complex RTL components. The proposed techniques are based on the observation that RTL component...
Nachiketh R. Potlapally, Michael S. Hsiao, Anand R...
IAJIT
2010
141views more  IAJIT 2010»
13 years 6 months ago
Complex Gain Predistortion in WCDMA Power Amplifiers with Memory Effects
: Power amplifiers are essential components in communication systems and are inherently nonlinear. The nonlinearity creates spectral growth beyond the signal bandwidth, which inter...
Pooria Varahram, Somayeh Mohammady, Mohd Hamidon, ...
NETWORKING
2008
13 years 9 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
CORR
2007
Springer
149views Education» more  CORR 2007»
13 years 7 months ago
Very fast watermarking by reversible contrast mapping
—Reversible contrast mapping (RCM) is a simple integer transform that applies to pairs of pixels. For some pairs of pixels, RCM is invertible, even if the least significant bits...
Dinu Coltuc, Jean-Marc Chassery