Sciweavers

376 search results - page 6 / 76
» General Reversibility
Sort
View
CONPAR
1992
14 years 20 days ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
AMAST
2006
Springer
14 years 10 days ago
The Substitution Vanishes
Abstract. Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient progr...
Armin Kühnemann, Andreas Maletti
ICICS
2005
Springer
14 years 2 months ago
Reversible Watermark with Large Capacity Using the Predictive Coding
A reversible watermarking algorithm with large capacity has been developed by applying the difference expansion of a generalized integer transform. In this algorithm, a watermark ...
Minoru Kuribayashi, Masakatu Morii, Hatsukazu Tana...
IJAC
2006
93views more  IJAC 2006»
13 years 8 months ago
On Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
Patrick Dehornoy, Bert Wiest
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 8 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...