Sciweavers

2750 search results - page 532 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
AAAI
1998
13 years 8 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
WM
2003
13 years 8 months ago
Knowledge discovery methods
: Coping with complex and dynamic environments forces companies to invest in the resource knowledge for the maintenance of their operational reliability; they have to create and to...
Stefan Smolnik
IJCAI
1997
13 years 8 months ago
Object Identification in a Bayesian Context
Object identification—the task of deciding that two observed objects are in fact one and the same object—is a fundamental requirement for any situated agent that reasons about...
Timothy Huang, Stuart J. Russell
NIPS
1997
13 years 8 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
WSC
2000
13 years 8 months ago
Model abstraction for discrete event systems using neural networks and sensitivity information
STRACTION FOR DISCRETE EVENT SYSTEMS USING NEURAL NETWORKS AND SENSITIVITY INFORMATION Christos G. Panayiotou Christos G. Cassandras Department of Manufacturing Engineering Boston ...
Christos G. Panayiotou, Christos G. Cassandras, We...