14158 search results - page 102 / 2832 » Generalized switch-setting problems |
104
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
104
Voted
NIPS
2007
15 years 3 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...
93
Voted
WSC
1998
15 years 3 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...
96
Voted
COLING
1996
15 years 3 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...
115
Voted
EOR
2008
15 years 2 months 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...