Sciweavers

265 search results - page 49 / 53
» How Many Query Superpositions Are Needed to Learn
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
On optimizing subspaces for face recognition
We propose a subspace learning algorithm for face recognition by directly optimizing recognition performance scores. Our approach is motivated by the following observations: 1) Di...
Jilin Tu, Xiaoming Liu, Peter Henry Tu
SIAMIS
2011
13 years 2 months ago
Large Scale Bayesian Inference and Experimental Design for Sparse Linear Models
Abstract. Many problems of low-level computer vision and image processing, such as denoising, deconvolution, tomographic reconstruction or superresolution, can be addressed by maxi...
Matthias W. Seeger, Hannes Nickisch
AAAI
1998
13 years 9 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
WSDM
2012
ACM
309views Data Mining» more  WSDM 2012»
12 years 3 months ago
Mining contrastive opinions on political texts using cross-perspective topic model
This paper presents a novel opinion mining research problem, which is called Contrastive Opinion Modeling (COM). Given any query topic and a set of text collections from multiple ...
Yi Fang, Luo Si, Naveen Somasundaram, Zhengtao Yu
HICSS
2000
IEEE
180views Biometrics» more  HICSS 2000»
13 years 12 months ago
Evolving Use of a System for Education at a Distance
Computers and networks are increasingly able to support distributed collaborative multimedia applications. In fact, the growing interest in distance learning reflects the awarenes...
Stephen A. White, Anoop Gupta, Jonathan Grudin, Ha...