Sciweavers

406 search results - page 21 / 82
» A Cost Model for Similarity Queries in Metric Spaces
Sort
View
JEA
2008
112views more  JEA 2008»
13 years 7 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 11 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICASSP
2011
IEEE
12 years 11 months ago
Integrating frame-based and segment-based dynamic time warping for unsupervised spoken term detection with spoken queries
Rapidly increasing quantities of multimedia and spoken content today demand fast and accurate retrieval approaches for convenient browsing. The spoken documents with wide variety ...
Chun-an Chan, Lin-Shan Lee
TIME
2002
IEEE
14 years 13 days ago
Representation and Reasoning with Disjunctive Temporal Constraints
We show the expressiveness provided by a Labelled point-based metric model for specifying and reasoning about complex disjunctive temporal constraints. The model allows us to mana...
María Isabel Alfonso Galipienso, Federico B...
AIPS
2006
13 years 9 months ago
Resource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
Laurence A. Kramer, Stephen F. Smith