175 search results - page 28 / 35 » Bounds for Permutation Rate-Distortion |
94
Voted
INFOCOM
2003
IEEE
15 years 6 months ago
2003
IEEE
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challe...
104
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
86
Voted
COCOON
2009
Springer
15 years 7 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...
90
Voted
CADE
2002
Springer
16 years 1 months ago
2002
Springer
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
112
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...