Sciweavers

11231 search results - page 164 / 2247
» Digging for Data Structures
Sort
View
141
Voted
DATESO
2009
158views Database» more  DATESO 2009»
15 years 16 days ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
149
Voted
IEEEICCI
2009
IEEE
15 years 13 days ago
Learning from an ensemble of Receptive Fields
Abstract-In this paper, we construct a neural-inspired computational model based on the representational capabilities of receptive fields. The proposed model, known as Shape Encodi...
Hanlin Goh, Joo Hwe Lim, Chai Quek
195
Voted
AROBOTS
2011
14 years 9 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...
161
Voted
SDM
2009
SIAM
202views Data Mining» more  SDM 2009»
15 years 12 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 8 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...