Sciweavers

7758 search results - page 366 / 1552
» On the Number of Distributive Lattices
Sort
View
DM
2011
188views Education» more  DM 2011»
15 years 1 months ago
Singletons and adjacencies of set partitions of type B
We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type Bn without zero-block, in analo...
William Y. C. Chen, David G. L. Wang
SACRYPT
2009
Springer
176views Cryptology» more  SACRYPT 2009»
16 years 1 months ago
Optimization Strategies for Hardware-Based Cofactorization
Abstract. We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorizatio...
Daniel Loebenberger, Jens Putzka
EPEW
2007
Springer
16 years 28 days ago
A Fixed-Point Algorithm for Closed Queueing Networks
In this paper we propose a new efficient iterative scheme for solving closed queueing networks with phase-type service time distributions. The method is especially efficient and ac...
Ramin Sadre, Boudewijn R. Haverkort, Patrick Reine...
ASAP
2005
IEEE
99views Hardware» more  ASAP 2005»
16 years 11 days ago
Variable Radix Real and Complex Digit-Recurrence Division
We propose a digit-recurrence algorithm for division in real and complex number domains using a variable radix. The objective of the approach is to simplify the prescaling of the ...
Milos D. Ercegovac, Jean-Michel Muller
162
Voted
JDA
2008
85views more  JDA 2008»
15 years 6 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...