Sciweavers

102 search results - page 20 / 21
» Bounded Query Functions with Limited Output Bits
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 7 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
MSWIM
2009
ACM
14 years 2 months ago
A performance evaluation framework for fair solutions in ad hoc networks
Fairness in multihop ad hoc networks has received considerable attention in the literature. Many schemes have been proposed, which attempt to compute the “optimal” bit rates o...
Manos Dramitinos, Rémi Vannier, Isabelle Gu...
CGF
2008
201views more  CGF 2008»
13 years 7 months ago
High-Resolution Volumetric Computation of Offset Surfaces with Feature Preservation
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
Darko Pavic, Leif Kobbelt
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 7 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
SEMCO
2007
IEEE
14 years 1 months ago
A Semantic Matching Algorithm for Discovery in UDDI
One of the key objectives of web service technology is to construct processes that enable service providers to inter-connect with their clients. The industry has developed the UDD...
Unai Aguilera, Joseba Abaitua, Josuka Diaz, David ...