Sciweavers

1491 search results - page 45 / 299
» Training Linear Discriminant Analysis in Linear Time
Sort
View
ACL
2007
14 years 11 months ago
Boosting Statistical Machine Translation by Lemmatization and Linear Interpolation
Data sparseness is one of the factors that degrade statistical machine translation (SMT). Existing work has shown that using morphosyntactic information is an effective solution t...
Ruiqiang Zhang, Eiichiro Sumita
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
15 years 3 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
AAAI
2008
15 years 2 days ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
15 years 10 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
15 years 10 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher