Sciweavers

162 search results - page 10 / 33
» Exact and Approximated Error of the FMA
Sort
View
NIPS
2007
13 years 8 months ago
Bayesian binning beats approximate alternatives: estimating peri-stimulus time histograms
The peristimulus time histogram (PSTH) and its more continuous cousin, the spike density function (SDF) are staples in the analytic toolkit of neurophysiologists. The former is us...
Dominik Endres, Mike W. Oram, Johannes E. Schindel...
ICML
2010
IEEE
13 years 8 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 7 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
ICALP
2009
Springer
14 years 7 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
GEOINFO
2004
13 years 8 months ago
Approximate Spatial Query Processing using Raster Signatures
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
Leonardo Guerreiro Azevedo, Rodrigo Salvador Monte...