Sciweavers

1688 search results - page 193 / 338
» Implementing Optimizations at Decode Time
Sort
View
SPAA
1996
ACM
14 years 12 days ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
ISVLSI
2006
IEEE
126views VLSI» more  ISVLSI 2006»
14 years 2 months ago
QUKU: A Two-Level Reconfigurable Architecture
FPGAs have been used for prototyping of ASICs, for low-volume ASIC replacement and for systems requiring in-field hardware upgrades. However, the potential to use dynamic reconfig...
Sunil Shukla, Neil W. Bergmann, Jürgen Becker
SRDS
2003
IEEE
14 years 1 months ago
Distributed Programming for Dummies: A Shifting Transformation Technique
The perfectly synchronized round model provides the abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We p...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
COOPIS
1999
IEEE
14 years 18 days ago
Selectively Materializing Data in Mediators by Analyzing User Queries
There is currently great interest in building information mediators that can integrate informationfrom multipledata sources such as databases or Web sources. The query response ti...
Naveen Ashish, Craig A. Knoblock, Cyrus Shahabi
SWAT
1992
Springer
116views Algorithms» more  SWAT 1992»
14 years 10 days ago
Sorting Multisets Stably in Minimum Space
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
Jyrki Katajainen, Tomi Pasanen