Sciweavers

1079 search results - page 92 / 216
» An Implementation of an Address Generator Using Hash Memorie...
Sort
View
JSC
2011
99views more  JSC 2011»
13 years 2 days ago
Sparse polynomial division using a heap
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
Michael B. Monagan, Roman Pearce
CGO
2010
IEEE
14 years 4 months ago
Integrated instruction selection and register allocation for compact code generation exploiting freeform mixing of 16- and 32-bi
For memory constrained embedded systems code size is at least as important as performance. One way of increasing code density is to exploit compact instruction formats, e.g. ARM T...
Tobias J. K. Edler von Koch, Igor Böhm, Bj&ou...
DBKDA
2009
IEEE
76views Database» more  DBKDA 2009»
14 years 1 months ago
Using Input Buffers for Streaming XSLT Processing
We present a buffering streaming engine for processing top-down XSLT transformations. It consists of an analyzer and a transformer. The analyzer examines given top-down XSLT and X...
Jana Dvoráková, Filip Zavoral
CGF
2005
199views more  CGF 2005»
13 years 9 months ago
Glare Generation Based on Wave Optics
This paper proposes a novel and general method of glare generation based on wave optics. A glare image is regarded as a result of Fraunhofer diffraction, which is equivalent to a ...
Masanori Kakimoto, Kaoru Matsuoka, Tomoyuki Nishit...
INFOCOM
1999
IEEE
14 years 1 months ago
High Performance IP Routing Table Lookup using CPU Caching
Wire-speed IP (Internet Protocol) routers require very fast routing table lookup for incoming IP packets. The routing table lookup operation is time consuming because the part of ...
Tzi-cker Chiueh, Prashant Pradhan