Sciweavers

265 search results - page 48 / 53
» A Scheme for Approximating Probabilistic Inference
Sort
View
ASPDAC
2008
ACM
174views Hardware» more  ASPDAC 2008»
13 years 10 months ago
Chebyshev Affine Arithmetic based parametric yield prediction under limited descriptions of uncertainty
In modern circuit design, it is difficult to provide reliable parametric yield prediction since the real distribution of process data is hard to measure. Most existing approaches ...
Jin Sun, Yue Huang, Jun Li, Janet Meiling Wang
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
11 years 11 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
14 years 3 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
ICCV
2009
IEEE
1957views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Robust Visual Tracking using L1 Minimization
In this paper we propose a robust visual tracking method by casting tracking as a sparse approximation problem in a particle filter framework. In this framework, occlusion, corru...
Xue Mei, Haibin Ling
ICCV
2007
IEEE
14 years 10 months ago
Graph Based Discriminative Learning for Robust and Efficient Object Tracking
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...
Xiaoqin Zhang, Weiming Hu, Stephen J. Maybank, Xi ...