5115 search results - page 522 / 1023 » On Randomized Lanczos Algorithms |
150
click to vote
AAAI
2006
15 years 8 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
252
click to vote
IJCAI
2003
15 years 8 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
201
click to vote
WSCG
2004
15 years 8 months ago
2004
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
188
click to vote
UAI
2003
15 years 8 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...
208
Voted
SODA
2000
ACM
15 years 8 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...