Sciweavers

85 search results - page 12 / 17
» Tree-Structured Haar Transforms
Sort
View
CONPAR
1992
13 years 11 months 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
13 years 11 months 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
ICFP
2006
ACM
14 years 7 months ago
biXid: a bidirectional transformation language for XML
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
Shinya Kawanaka, Haruo Hosoya
VLDB
2001
ACM
129views Database» more  VLDB 2001»
14 years 1 days ago
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
Yasushi Sakurai, Masatoshi Yoshikawa, Ryoji Kataok...
SEMWEB
2004
Springer
14 years 29 days ago
Inferring Data Transformation Rules to Integrate Semantic Web Services
Abstract. OWL-S allows selecting, composing and invoking Web Serdifferent levels of abstraction: selection uses high level abstract descriptions, invocation uses low level groundi...
Bruce Spencer, Sandy Liu