Sciweavers

154 search results - page 23 / 31
» algorithmica 2007
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 9 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
ALGORITHMICA
2002
83views more  ALGORITHMICA 2002»
13 years 9 months ago
A Tutorial for Designing Flexible Geometric Algorithms
The implementation of an algorithm is faced with the issues efficiency, flexibility, and ease-of-use. In this paper, we suggest a design concept that greatly increases the flexibi...
Vikas Kapoor, Dietmar Kühl, Alexander Wolff
ALGORITHMICA
2000
87views more  ALGORITHMICA 2000»
13 years 9 months ago
Linear Size Binary Space Partitions for Uncluttered Scenes
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
Mark de Berg
ALGORITHMICA
2000
72views more  ALGORITHMICA 2000»
13 years 9 months ago
Sorting-Based Selection Algorithms for Hypercubic Networks
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
Pascal Berthomé, Afonso Ferreira, Bruce M. ...
ALGORITHMICA
2000
106views more  ALGORITHMICA 2000»
13 years 9 months ago
Algorithms for Sensorless Manipulation Using a Vibrating Surface
We describe a programmable apparatus that uses a vibrating surface for sensorless, nonprehensile manipulation, where parts are systematically positioned and oriented without sensor...
Karl-Friedrich Böhringer, Vivek Bhatt, Bruce ...