102 search results - page 12 / 21 » Improved Bounds for Geometric Permutations |
127
click to vote
FTTCS
2006
15 years 1 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
110
click to vote
WINE
2009
Springer
15 years 8 months ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
121
click to vote
DCC
2007
IEEE
16 years 1 months ago
2007
IEEE
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We a...
COCOON
2009
Springer
15 years 8 months ago
2009
Springer
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...
128
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...