Sciweavers

36 search results - page 1 / 8
» Resizable Arrays in Optimal Time and Space
Sort
View
WADS
1999
Springer
96views Algorithms» more  WADS 1999»
13 years 9 months ago
Resizable Arrays in Optimal Time and Space
Andrej Brodnik, Svante Carlsson, Erik D. Demaine, ...
ACCV
2009
Springer
13 years 9 months ago
Efficient Scale-Space Spatiotemporal Saliency Tracking for Distortion-Free Video Retargeting
Video retargeting aims at transforming an existing video in order to display it appropriately on a target device, often in a lower resolution, such as a mobile phone. To preserve a...
Gang Hua, Cha Zhang, Zicheng Liu, Zhengyou Zhang, ...
WAE
2001
236views Algorithms» more  WAE 2001»
13 years 6 months ago
Experiences with the Design and Implementation of Space-Efficient Deques
Abstract. A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pil...
Jyrki Katajainen, Bjarke Buur Mortensen
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
13 years 3 months ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...
PLDI
2010
ACM
13 years 10 months ago
Z-rays: divide arrays and conquer speed and flexibility
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...
Jennifer B. Sartor, Stephen M. Blackburn, Daniel F...