Sciweavers

59 search results - page 8 / 12
» The Many Facets of Approximate Similarity Search
Sort
View
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 2 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 9 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...
IAT
2007
IEEE
15 years 3 months ago
An Intelligent Web Agent to Mine Bilingual Parallel Pages via Automatic Discovery of URL Pairing Patterns
This paper describes an intelligent agent to facilitate bitext mining from the Web via automatic discovery of URL pairing patterns (or keys) for retrieving parallel web pages. The...
Chunyu Kit, Jessica Yee Ha Ng
99
Voted
EWC
2010
178views more  EWC 2010»
14 years 6 months ago
Design of tensegrity structures using parametric analysis and stochastic search
Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, findin...
Landolf Rhode-Barbarigos, Himanshu Jain, Prakash K...
SSD
2007
Springer
124views Database» more  SSD 2007»
15 years 3 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...