2569 search results - page 45 / 514 » Approximate Objects and Approximate Theories |
122
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
187
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
182
Voted
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
107
click to vote
TNN
2010
14 years 6 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
126
click to vote
PODS
2007
ACM
15 years 12 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...