Sciweavers

634 search results - page 53 / 127
» Fast Evaluation Techniques for Complex Similarity Queries
Sort
View
XSYM
2005
Springer
81views Database» more  XSYM 2005»
14 years 1 months ago
MemBeR: A Micro-benchmark Repository for XQuery
XQuery is a feature-rich language with complex semantics. This makes it hard to come up with a benchmark suite which covers all performance-critical features of the language, and a...
Loredana Afanasiev, Ioana Manolescu, Philippe Mich...
VMV
2007
141views Visualization» more  VMV 2007»
13 years 9 months ago
Distance Calculation between a Point and a Subdivision Surface
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
Torsten Ullrich, Volker Settgast, Ulrich Krispel, ...
ICASSP
2007
IEEE
13 years 10 months ago
Variable Regularized Fast Affine Projections
This paper introduces a variable regularization method for the fast affine projection algorithm (VR-FAP). It is inspired by a recently introduced technique for variable regulariza...
Deepak Challa, Steven L. Grant, Asif Iqbal Mohamma...
WWW
2005
ACM
14 years 8 months ago
SemRank: ranking complex relationship search results on the semantic web
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
14 years 13 days ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...