Sciweavers

822 search results - page 16 / 165
» Hashing Methods for Temporal Data
Sort
View
JAIR
2006
137views more  JAIR 2006»
13 years 7 months ago
Learning Sentence-internal Temporal Relations
In this paper we propose a data intensive approach for inferring sentence-internal temporal relations. Temporal inference is relevant for practical NLP applications which either e...
Maria Lapata, Alex Lascarides
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 14 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...
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 7 months ago
Boosting Multi-Core Reachability Performance with Shared Hash Tables
Abstract--This paper focuses on data structures for multicore reachability, which is a key component in model checking algorithms and other verification methods. A cornerstone of a...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...
ICCV
2009
IEEE
1022views Computer Vision» more  ICCV 2009»
15 years 18 days ago
Kernelized Locality-Sensitive Hashing for Scalable Image Search
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed high-dimensional features or complex distance fun...
Brian Kulis, Kristen Grauman
FGR
2004
IEEE
133views Biometrics» more  FGR 2004»
13 years 11 months ago
Finding Temporal Patterns by Data Decomposition
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...
David C. Minnen, Christopher Richard Wren