Sciweavers

720 search results - page 94 / 144
» Linear k-arboricities on trees
Sort
View
FCCM
1999
IEEE
111views VLSI» more  FCCM 1999»
14 years 2 months ago
Optimizing FPGA-Based Vector Product Designs
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...
Dan Benyamin, John D. Villasenor, Wayne Luk
DBPL
1999
Springer
114views Database» more  DBPL 1999»
14 years 2 months ago
Structured Document Transformations Based on XSL
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
Sebastian Maneth, Frank Neven
IPPS
1996
IEEE
14 years 2 months ago
Kiloprocessor Extensions to SCI
To expand the Scalable Coherent Interface's (SCI) capabilities so it can be used to efficiently handle sharing in systems of hundreds or even thousands of processors, the SCI...
Stefanos Kaxiras
SC
1994
ACM
14 years 2 months ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar
CSR
2008
Springer
13 years 11 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma