Sciweavers

2095 search results - page 293 / 419
» Improved pebbling bounds
Sort
View
ATAL
2009
Springer
14 years 4 months ago
The price of democracy in coalition formation
Whenever rational agents form coalitions to execute tasks, doing so via a decentralized negotiation process—while more robust and democratic—may lead to a loss of efficiency ...
Georgios Chalkiadakis, Edith Elkind, Maria Polukar...
COCOON
2009
Springer
14 years 4 months ago
On Smoothed Analysis of Quicksort and Hoare's Find
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Ni...
ACSC
2008
IEEE
14 years 4 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
CGO
2008
IEEE
14 years 4 months ago
Automatic array inlining in java virtual machines
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
Christian Wimmer, Hanspeter Mössenböck
ICASSP
2008
IEEE
14 years 4 months ago
Efficient channel quantization scheme for multi-user MIMO broadcast channels with RBD precoding
Abstract — Regularized block diagonalization (RBD) is a new linear precoding technique for the multi-antenna broadcast channel and has a significantly improved sum rate and dive...
Bin Song, Florian Roemer, Martin Haardt