Sciweavers

275 search results - page 15 / 55
» On the computational power of iterative auctions
Sort
View
TIT
2010
108views Education» more  TIT 2010»
14 years 4 months ago
Optimal pairings
In this paper we introduce the concept of an optimal pairing, which by definition can be computed using only log2 r/(k) basic Miller iterations, with r the order of the groups invo...
Frederik Vercauteren
TCOM
2008
85views more  TCOM 2008»
14 years 9 months ago
Balanced capacity of wireline multiple access channels with individual power constraints
This paper applies the concept of balanced capacity (a tradeoff between performance and fairness) to the uplink of a frequency-selective multiuser channel. Individual power constr...
Thierry Sartenaer, Jérôme Louveaux, L...
TVLSI
1998
124views more  TVLSI 1998»
14 years 9 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
85
Voted
WWW
2004
ACM
15 years 10 months ago
Updating pagerank with iterative aggregation
We present an algorithm for updating the PageRank vector [1]. Due to the scale of the web, Google only updates its famous PageRank vector on a monthly basis. However, the Web chan...
Amy Nicole Langville, Carl Dean Meyer
MAM
2011
349views Communications» more  MAM 2011»
14 years 4 months ago
An iterative logarithmic multiplier
The paper presents a new multiplier enabling achievement of an arbitrary accuracy. It follows the same idea of number representation as the Mitchell’s algorithm, but does not use...
Zdenka Babic, Aleksej Avramovic, Patricio Bulic