Sciweavers

1092 search results - page 209 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
ICIP
2003
IEEE
16 years 1 months ago
Feature selection for unsupervised discovery of statistical temporal structures in video
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...
Lexing Xie, Shih-Fu Chang, Ajay Divakaran, Huifang...
SC
2005
ACM
15 years 5 months ago
Bridging the Macro and Micro: A Computing Intensive Earthquake Study Using Discovery Net
We present the development and use of a novel distributed geohazard modeling environment for the analysis and interpretation of large scale earthquake data sets. Our work demonstr...
Yike Guo, Jian Guo Liu, Moustafa Ghanem, Kyran Mis...
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 1 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
NIPS
1989
15 years 25 days ago
The Cascade-Correlation Learning Architecture
Cascade-Correlation is a new architecture and supervised learning algorithm for artificial neural networks. Instead of just adjusting the weights in a network of fixed topology,...
Scott E. Fahlman, Christian Lebiere
DAGM
2010
Springer
15 years 23 days ago
Gaussian Mixture Modeling with Gaussian Process Latent Variable Models
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
Hannes Nickisch, Carl Edward Rasmussen