3422 search results - page 488 / 685 » Random Subset Optimization |
141
click to vote
IJCAI
2003
15 years 4 months ago
2003
We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including t...
122
click to vote
SSWMC
2004
15 years 4 months ago
2004
In this paper, we present a new method for estimating the secret message length of bit-streams embedded using the Least Significant Bit embedding (LSB) at random pixel positions. ...
108
Voted
AAAI
2000
15 years 4 months ago
2000
Gridworlds are popular testbeds for planning with incomplete information but not much is known about their properties. We study a fundamental planning problem, localization, to in...
130
Voted
UAI
2003
15 years 4 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
132
click to vote
NIPS
1996
15 years 4 months ago
1996
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...