Sciweavers

17760 search results - page 334 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
CSC
2006
15 years 8 months ago
An Algorithm to Solve a Linear Program
: This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear p...
Rajan Alex
NECO
2007
129views more  NECO 2007»
15 years 6 months ago
Variational Bayes Solution of Linear Neural Networks and Its Generalization Performance
It is well-known that, in unidentifiable models, the Bayes estimation provides much better generalization performance than the maximum likelihood (ML) estimation. However, its ac...
Shinichi Nakajima, Sumio Watanabe
PAMI
2007
249views more  PAMI 2007»
15 years 6 months ago
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition
— The traditional image representations are not suited to conventional classification methods, such as the linear discriminant analysis (LDA), because of the under sample problem...
Dacheng Tao, Xuelong Li, Xindong Wu, Stephen J. Ma...
IJCV
2008
157views more  IJCV 2008»
15 years 6 months ago
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
Systems utilizing multiple sensors are required in many domains. In this paper, we specifically concern ourselves with applications where dynamic objects appear randomly and the s...
Anurag Mittal, Larry S. Davis
154
Voted
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
16 years 7 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...