Sciweavers

1957 search results - page 38 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
COCOON
2010
Springer
15 years 1 months ago
A Three-String Approach to the Closest String Problem
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
Zhi-Zhong Chen, Bin Ma, Lusheng Wang
98
Voted
IJCAI
2001
14 years 11 months ago
Approximate inference for first-order probabilistic languages
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
Hanna Pasula, Stuart J. Russell
EDBT
2002
ACM
129views Database» more  EDBT 2002»
15 years 9 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
14 years 10 months ago
Hierarchical evolution of linear regressors
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
Francesc Teixidó-Navarro, Albert Orriols-Pu...
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
15 years 4 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips