Sciweavers

28 search results - page 3 / 6
» Compact Summaries over Large Datasets
Sort
View
TKDE
2012
270views Formal Methods» more  TKDE 2012»
11 years 8 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
VIS
2009
IEEE
205views Visualization» more  VIS 2009»
14 years 7 months ago
Time and Streak Surfaces for Flow Visualization in Large Time-Varying Data Sets
Time and streak surfaces are ideal tools to illustrate time-varying vector fields since they directly appeal to the intuition about coherently moving particles. However, efficient ...
Hari Krishnan, Christoph Garth, Kenneth I. Joy
TCSV
2010
13 years 14 days ago
Efficient and Robust Detection of Duplicate Videos in a Large Database
We present an efficient and accurate method for duplicate video detection in a large database using video fingerprints. We have empirically chosen the Color Layout Descriptor, a c...
Anindya Sarkar, Vishwakarma Singh, Pratim Ghosh, B...
RAS
2007
102views more  RAS 2007»
13 years 5 months ago
Fast and accurate SLAM with Rao-Blackwellized particle filters
Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter in which each ...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
BMVC
2010
13 years 3 months ago
Learning Directional Local Pairwise Bases with Sparse Coding
Recently, sparse coding has been receiving much attention in object and scene recognition tasks because of its superiority in learning an effective codebook over k-means clusterin...
Nobuyuki Morioka, Shin'ichi Satoh