Sciweavers

2883 search results - page 22 / 577
» Algorithms for merged indexes
Sort
View
FPL
2005
Springer
121views Hardware» more  FPL 2005»
14 years 2 months ago
Configuration Merging for Adaptive Computer Applications
We present experimental evidence that multiple compute-units, compiled from sequential high-level language input programs, can be merged into a reduced number of configurations f...
Nico Kasprzyk, Jan van der Veen, Andreas Koch
FCT
2009
Springer
14 years 1 months ago
Multiway In-Place Merging
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...
Viliam Geffert, Jozef Gajdos
ICPR
2010
IEEE
13 years 8 months ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina
CVPR
2003
IEEE
14 years 10 months ago
On Region Merging: The Statistical Soundness of Fast Sorting, with Applications
This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...
Frank Nielsen, Richard Nock
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
13 years 10 months ago
Versioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...