Sciweavers

336 search results - page 17 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
The implication of data diversity for a classifier-free ensemble selection in random subspaces
Ensemble of Classifiers (EoC) has been shown effective in improving the performance of single classifiers by combining their outputs. By using diverse data subsets to train classi...
Albert Hung-Ren Ko, Robert Sabourin, Luiz E. Soare...
ICPR
2006
IEEE
14 years 1 months ago
Gesture Segmentation from a Video Sequence Using Greedy Similarity Measure
We propose a novel method of greedy similarity measure to segment long spatial-temporal video sequences. Firstly, a principal curve of motion region along frames of a video sequen...
Qiulei Dong, Yihong Wu, Zhanyi Hu
ICDCS
2007
IEEE
14 years 1 months ago
Differentiated Data Persistence with Priority Random Linear Codes
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable...
Yunfeng Lin, Baochun Li, Ben Liang
AAAI
2008
13 years 9 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
SIAMIS
2010
129views more  SIAMIS 2010»
13 years 2 months ago
Compressed Remote Sensing of Sparse Objects
Abstract. The linear inverse source and scattering problems are studied from the perspective of compressed sensing, in particular the idea that sufficient incoherence and sparsity ...
Albert Fannjiang, Thomas Strohmer, Pengchong Yan