4894 search results - page 755 / 979 » The Guarding Problem - Complexity and Approximation |
NIPS
2003
13 years 9 months ago
2003
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
AAAI
2000
13 years 9 months ago
2000
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
UAI
2003
13 years 9 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
ICONIP
1998
13 years 9 months ago
1998
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
NIPS
1998
13 years 9 months ago
1998
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...