Sciweavers

1523 search results - page 195 / 305
» The Computational Complexity of Linear Optics
Sort
View
157
Voted
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
15 years 5 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
IPCO
2008
114views Optimization» more  IPCO 2008»
15 years 5 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi
142
Voted
ICONIP
2007
15 years 5 months ago
Principal Component Analysis for Sparse High-Dimensional Data
Abstract. Principal component analysis (PCA) is a widely used technique for data analysis and dimensionality reduction. Eigenvalue decomposition is the standard algorithm for solvi...
Tapani Raiko, Alexander Ilin, Juha Karhunen
NIPS
2008
15 years 5 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
SDM
2008
SIAM
117views Data Mining» more  SDM 2008»
15 years 5 months ago
A Feature Selection Algorithm Capable of Handling Extremely Large Data Dimensionality
With the advent of high throughput technologies, feature selection has become increasingly important in a wide range of scientific disciplines. We propose a new feature selection ...
Yijun Sun, Sinisa Todorovic, Steve Goodison