Sciweavers

1688 search results - page 169 / 338
» Implementing Optimizations at Decode Time
Sort
View
GLVLSI
2003
IEEE
310views VLSI» more  GLVLSI 2003»
14 years 1 months ago
54x54-bit radix-4 multiplier based on modified booth algorithm
In this paper, we describe a low power and high speed multiplier suitable for standard cell-based ASIC design methodologies. For the purpose, an optimized booth encoder, compact 2...
Ki-seon Cho, Jong-on Park, Jin-seok Hong, Goang-se...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 8 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
14 years 14 days ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
PSTV
1992
113views Hardware» more  PSTV 1992»
13 years 9 months ago
Coverage Preserving Reduction Strategies for Reachability Analysis
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
Gerard J. Holzmann, Patrice Godefroid, Didier Piro...
ICIP
2010
IEEE
13 years 6 months ago
Complexity-scalable H.264/AVC in an IPP-based video encoder
Real-time high-definition video encoding is a computationhungry task that challenges software-based solutions. For that, in this work we adopted an Intel software implementation o...
Tiago A. da Fonseca, Ricardo L. de Queiroz, Debarg...