Sciweavers

11211 search results - page 204 / 2243
» Rank-Sensitive Data Structures
Sort
View
AROBOTS
2011
15 years 1 months ago
Human motion database with a binary tree and node transition graphs
— Database of human motion has been widely used for recognizing human motion and synthesizing humanoid motions. In this paper, we propose a data structure for storing and extract...
Katsu Yamane, Yoshifumi Yamaguchi, Yoshihiko Nakam...
SDM
2009
SIAM
202views Data Mining» more  SDM 2009»
16 years 3 months ago
Proximity-Based Anomaly Detection Using Sparse Structure Learning.
We consider the task of performing anomaly detection in highly noisy multivariate data. In many applications involving real-valued time-series data, such as physical sensor data a...
Tsuyoshi Idé, Aurelie C. Lozano, Naoki Abe,...
GFKL
2005
Springer
95views Data Mining» more  GFKL 2005»
15 years 12 months ago
An Indicator for the Number of Clusters: Using a Linear Map to Simplex Structure
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...
ICST
2010
IEEE
15 years 4 months ago
Timed Moore Automata: Test Data Generation and Model Checking
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
Helge Löding, Jan Peleska
PODS
2006
ACM
108views Database» more  PODS 2006»
16 years 6 months ago
Deterministic k-set structure
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
Sumit Ganguly, Anirban Majumder