36 search results - page 3 / 8 » Resizable Arrays in Optimal Time and Space |
MST
2006
14 years 11 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
115
click to vote
DATE
2010
IEEE
14 years 10 months ago
2010
IEEE
—Starting from sequential programs, we present an approach combining data reuse, multi-level MapReduce, and pipelining to automatically find the most power-efficient designs th...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The goal of combining beamforming and space-time coding is to obtain full-diversity order and to provide additional received power (array gain) compared to conventional space-time...
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
104
click to vote
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We introduce a new algorithm for video retargeting that uses discontinuous seam-carving in both space and time for resizing videos. Our algorithm relies on a novel appearance-base...