Sciweavers

169 search results - page 33 / 34
» Reductions among high dimensional proximity problems
Sort
View
24
Voted
SPAA
1997
ACM
13 years 11 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
BMCBI
2006
146views more  BMCBI 2006»
13 years 6 months ago
Recursive gene selection based on maximum margin criterion: a comparison with SVM-RFE
Background: In class prediction problems using microarray data, gene selection is essential to improve the prediction accuracy and to identify potential marker genes for a disease...
Satoshi Niijima, Satoru Kuhara
ADHOCNETS
2009
Springer
13 years 9 months ago
Efficient Distribution of Large Files in UMTS Supported by Network Coded M2M Data Transfer with Multiple Generations
This paper is a sequel of previous work, in which we have studied the traffic management problem in UMTS. The main objective was to improve the spectral efficiency of cellular netw...
Larissa Popova, Wolfgang H. Gerstacker, Wolfgang K...
IJCV
2008
282views more  IJCV 2008»
14 years 11 months ago
Stereo Matching Using Population-Based MCMC
In this paper, we propose a new stereo matching method using the population-based Markov Chain Monte Carlo (Pop-MCMC), which belongs to the sampling-based methods. Since the previo...
Wonsik Kim (Seoul National University), Joonyoung ...
MMM
2005
Springer
163views Multimedia» more  MMM 2005»
14 years 13 days ago
Parallel Image Matrix Compression for Face Recognition
The canonical face recognition algorithm Eigenface and Fisherface are both based on one dimensional vector representation. However, with the high feature dimensions and the small ...
Dong Xu, Shuicheng Yan, Lei Zhang, Mingjing Li, We...