14161 search results - page 82 / 2833 » On generalized middle-level problem |
91
Voted
NIPS
2007
15 years 2 months ago
2007
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
86
Voted
WSC
1998
15 years 2 months ago
1998
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
83
Voted
COLING
1996
15 years 2 months ago
1996
Our main motivation is to build general and adaptable linguistic tools and we have faced the problem of their portability. We first make a quick description of the linguistic tool...
100
Voted
EOR
2008
15 years 26 days ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
88
Voted
SPIRE
2007
Springer
15 years 7 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...