Sciweavers

822 search results - page 70 / 165
» Hashing Methods for Temporal Data
Sort
View
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 7 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
ICA
2012
Springer
13 years 10 months ago
Audio Imputation Using the Non-negative Hidden Markov Model
Abstract. Missing data in corrupted audio recordings poses a challenging problem for audio signal processing. In this paper we present an approach that allows us to estimate missin...
Jinyu Han, Gautham J. Mysore, Bryan Pardo
CVPR
2008
IEEE
16 years 4 months ago
Sequential sparsification for change detection
This paper presents a general method for segmenting a vector valued sequence into an unknown number of subsequences where all data points from a subsequence can be represented wit...
Necmiye Ozay, Mario Sznaier, Octavia I. Camps
120
Voted
VRST
2009
ACM
15 years 9 months ago
Indexing and retrieval of human motion data by a hierarchical tree
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
Shuangyuan Wu, Zhaoqi Wang, Shihong Xia
PAKDD
1998
ACM
158views Data Mining» more  PAKDD 1998»
15 years 6 months ago
Data Mining Using Dynamically Constructed Recurrent Fuzzy Neural Networks
Abstract. Approaches to data mining proposed so far are mainly symbolic decision trees and numerical feedforward neural networks methods. While decision trees give, in many cases, ...
Yakov Frayman, Lipo Wang