Sciweavers

688 search results - page 68 / 138
» Computing with subspaces
Sort
View
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
14 years 11 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
CVPR
2012
IEEE
13 years 4 days ago
Dense Lagrangian motion estimation with occlusions
We couple occlusion modeling and multi-frame motion estimation to compute dense, temporally extended point trajectories in video with significant occlusions. Our approach combine...
Susanna Ricco, Carlo Tomasi
DATE
2003
IEEE
95views Hardware» more  DATE 2003»
15 years 3 months ago
A New Simulation Technique for Periodic Small-Signal Analysis
A new numerical technique for periodic small signal analysis based on harmonic balance method is proposed. Special-purpose numerical procedures based on Krylov subspace methods ar...
Mark M. Gourary, Sergey G. Rusakov, Sergey L. Ulya...
DCC
1999
IEEE
14 years 9 months ago
A General Polynomial Sieve
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
Shuhong Gao, Jason Howell
ICPR
2006
IEEE
15 years 3 months ago
Fast Linear Discriminant Analysis Using Binary Bases
Linear Discriminant Analysis (LDA) is a widely used technique for pattern classification. It seeks the linear projection of the data to a low dimensional subspace where the data ...
Feng Tang, Hai Tao