Sciweavers

1717 search results - page 7 / 344
» A Computable Spectral Theorem
Sort
View
TITS
2008
96views more  TITS 2008»
14 years 10 months ago
A Sampling Theorem Approach to Traffic Sensor Optimization
Abstract--With the objective of minimizing the total cost, which includes both sensor and congestion costs, the authors adopted a novel sampling theorem approach to address the pro...
Woei Ling Leow, Daiheng Ni, Hossein Pishro-Nik
PKDD
2004
Springer
116views Data Mining» more  PKDD 2004»
15 years 3 months ago
Random Matrices in Data Analysis
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
Dimitris Achlioptas
ECCV
2010
Springer
15 years 21 days ago
Learning Shape Segmentation Using Constrained Spectral Clustering and Probabilistic Label Transfer
We propose a spectral learning approach to shape segmentation. The method is composed of a constrained spectral clustering algorithm that is used to supervise the segmentation of a...
74
Voted
CIE
2010
Springer
15 years 3 months ago
Ergodic-Type Characterizations of Algorithmic Randomness
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alex...
81
Voted
ECML
2006
Springer
15 years 1 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...