Sciweavers

417 search results - page 78 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
CCGRID
2006
IEEE
15 years 3 months ago
Effective Load Balancing in P2P Systems
— In DHT based P2P systems, various issues such as peer heterogeneity, network topology, and diverse file popularity, may affect the DHT system efficiency. In this paper, we pr...
Zhiyong Xu, Laxmi N. Bhuyan
TVLSI
2002
97views more  TVLSI 2002»
14 years 9 months ago
Techniques for energy-efficient communication pipeline design
The performance of many modern computer and communication systems is dictated by the latency of communication pipelines. At the same time, power/energy consumption is often another...
Gang Qu, Miodrag Potkonjak
MOC
2010
14 years 4 months ago
The number field sieve for integers of low weight
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
Oliver Schirokauer
SIAMSC
2010
132views more  SIAMSC 2010»
14 years 4 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 7 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...