Sciweavers

1021 search results - page 169 / 205
» Fast Approximate PCPs
Sort
View
AAAI
2007
14 years 18 hour ago
Unscented Message Passing for Arbitrary Continuous Variables in Bayesian Networks
Since Bayesian network (BN) was introduced in the field of artificial intelligence in 1980s, a number of inference algorithms have been developed for probabilistic reasoning. Ho...
Wei Sun, Kuo-Chu Chang
ANNPR
2008
Springer
13 years 11 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi
ATAL
2008
Springer
13 years 11 months ago
Interaction-driven Markov games for decentralized multiagent planning under uncertainty
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
Matthijs T. J. Spaan, Francisco S. Melo
ARITH
2005
IEEE
13 years 11 months ago
Error-Free Computation of 8x8 2-D DCT and IDCT Using Two-Dimensional Algebraic Integer Quantization
This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a...
Khan Wahid, Vassil S. Dimitrov, Graham A. Jullien
COMPGEOM
2005
ACM
13 years 11 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk