4843 search results - page 332 / 969 » The Shortcut Problem - Complexity and Approximation |
153
Voted
KR
2004
Springer
15 years 9 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
126
click to vote
ESANN
2007
15 years 5 months ago
2007
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
122
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
We derive a number of well known deterministic latent variable models such as PCA, ICA, EPCA, NMF and PLSA as variational EM approximations with point posteriors. We show that the...
130
click to vote
NIPS
2007
15 years 5 months ago
2007
Markov jump processes play an important role in a large number of application domains. However, realistic systems are analytically intractable and they have traditionally been ana...
128
click to vote
ANOR
2002
15 years 4 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...