Sciweavers

1623 search results - page 52 / 325
» No Sorting
Sort
View
CORR
2002
Springer
166views Education» more  CORR 2002»
15 years 3 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
POPL
2008
ACM
16 years 4 months ago
Much ado about two (pearl): a pearl on parallel prefix computation
This pearl develops a statement about parallel prefix computation in the spirit of Knuth's 0-1-Principle for oblivious sorting algorithms. It turns out that 0-1 is not quite ...
Janis Voigtländer
167
Voted
VMCAI
2010
Springer
15 years 11 months ago
An Analysis of Permutations in Arrays
This paper is concerned with the synthesis of invariants in programs with arrays. More specifically, we consider properties concerning array contents up to a permutation. For inst...
Valentin Perrelle, Nicolas Halbwachs
APAL
2006
50views more  APAL 2006»
15 years 4 months ago
Imaginaries in real closed valued fields
The paper shows elimination of imaginaries for real closed valued fields to the geometric sorts which were introduced in the [6]. We also show that this result is in some sense op...
T. Mellor
CVPR
2003
IEEE
16 years 6 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