Sciweavers

2735 search results - page 466 / 547
» Comparing notions of randomness
Sort
View
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
13 years 14 days ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
EMMCVPR
2011
Springer
12 years 9 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
ICDAR
2011
IEEE
12 years 9 months ago
A New Feature Optimization Method Based on Two-Directional 2DLDA for Handwritten Chinese Character Recognition
—LDA transformation is one of the popular feature dimension reduction techniques for the feature extraction in most handwritten Chinese characters recognition systems. The integr...
Xue Gao, Wenhuan Wen, Lianwen Jin
JMLR
2012
12 years 3 days ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
TEC
2012
234views Formal Methods» more  TEC 2012»
12 years 2 days ago
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
Xiaodong Li, Xin Yao