Sciweavers

2621 search results - page 152 / 525
» Near orders and codes
Sort
View
APPINF
2003
15 years 8 months ago
Extracting High-level Architecture from Existing Code with Summary Models
Evolution of existing large telecommunications software currently became an important issue. Efficient methods are needed to componentize existing software identify existing compo...
Nikolai Mansurov, Djenana Campara
WSC
1997
15 years 7 months ago
Efficient Instruction Cache Simulation and Execution Profiling with a Threaded-Code Interpreter
We present an extension to an existing SPARC V8 instruction set simulator, SimICS, to support accurate profiling of branches and instruction cache misses. SimICS had previously su...
Peter S. Magnusson
DM
2008
112views more  DM 2008»
15 years 6 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
CORR
2007
Springer
92views Education» more  CORR 2007»
15 years 6 months ago
Bit-Interleaved Coded Multiple Beamforming with Imperfect CSIT
This paper addresses the performance of bit-interleaved coded multiple beamforming (BICMB) [1], [2] with imperfect knowledge of beamforming vectors. Most studies for limited-rate ...
Ersin Sengul, Ender Ayanoglu
TCSV
2008
128views more  TCSV 2008»
15 years 6 months ago
Redundant Slice Optimal Allocation for H.264 Multiple Description Coding
In this paper a novel H.264 multiple description technique is proposed. The coding approach is based on the redundant slice representation option, defined in the H.264 standard. In...
Tammam Tillo, Marco Grangetto, Gabriella Olmo