19866 search results - page 253 / 3974 » Computing all factorizations in *** |
139
click to vote
NA
2006
15 years 6 months ago
2006
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
165
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Soft error tolerant design becomes more crucial due to exponential increase in the vulnerability of computer systems to soft errors. Accurate estimation of soft error rate (SER), ...
150
click to vote
IPSN
2005
Springer
16 years 5 days ago
2005
Springer
— Over the last three years we have built and experimented with the Pushpin Computing wireless sensor network platform. The Pushpin platform is a tabletop multihop wireless senso...
186
click to vote
ANTS
2004
Springer
16 years 1 days ago
2004
Springer
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
183
click to vote
QCQC
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...