Sciweavers

15073 search results - page 340 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 7 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
ISNN
2005
Springer
15 years 10 months ago
Post-nonlinear Blind Source Separation Using Neural Networks with Sandwiched Structure
Abstract. This paper proposes a novel algorithm based on informax for postnonlinear blind source separation. The demixing system culminates to a neural network with sandwiched stru...
Chunhou Zheng, Deshuang Huang, Zhan-Li Sun, Li Sha...
AAAI
2010
15 years 6 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter
ICML
2008
IEEE
16 years 5 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
ICRA
2008
IEEE
172views Robotics» more  ICRA 2008»
15 years 11 months ago
Registration of colored 3D point clouds with a Kernel-based extension to the normal distributions transform
— We present a new algorithm for scan registration of colored 3D point data which is an extension to the Normal Distributions Transform (NDT). The probabilistic approach of NDT i...
Benjamin Huhle, Martin Magnusson 0002, Wolfgang St...