Sciweavers

6110 search results - page 239 / 1222
» Approximate Computing
Sort
View
IS
2008
15 years 6 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
EOR
2007
117views more  EOR 2007»
15 years 6 months ago
Simultaneous perturbation stochastic approximation of nonsmooth functions
A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This ...
Vaida Bartkute, Leonidas Sakalauskas
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 9 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
ICML
2004
IEEE
16 years 7 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
PKDD
2009
Springer
152views Data Mining» more  PKDD 2009»
16 years 1 months ago
Feature Selection for Value Function Approximation Using Bayesian Model Selection
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
Tobias Jung, Peter Stone