Sciweavers

3466 search results - page 209 / 694
» Fast computation of special resultants
Sort
View
ICPR
2008
IEEE
16 years 1 months ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang
ARITH
2001
IEEE
15 years 10 months ago
Worst Cases for Correct Rounding of the Elementary Functions in Double Precision
We give the results of our search for the worst cases for correct rounding of the major elementary functions in double precision floating-point arithmetic. These results allow the...
Vincent Lefèvre, Jean-Michel Muller
BIRTHDAY
2012
Springer
14 years 2 months ago
Operand Folding Hardware Multipliers
This paper describes a new accumulate-and-add multiplication algorithm. The method partitions one of the operands and re-combines the results of computations done with each of the ...
Byungchun Chung, Sandra Marcello, Amir-Pasha Mirba...
ICNP
1998
IEEE
15 years 11 months ago
Multicasting at the Host Interface Level in Wormhole Networks
In this paper we address the problem of providing transparent, reliable, and efficient network-level multicasting in wormhole LANs. We describe some alternatives for achieving dea...
Claudio Casetti, Emilio Leonardi, Fabio Neri, Cosi...
IPPS
1999
IEEE
15 years 11 months ago
An Efficient VLSI Architecture Parallel Prefix Counting With Domino Logic
We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the charge/discharge s...
Rong Lin, Koji Nakano, Stephan Olariu, Albert Y. Z...