Sciweavers

3913 search results - page 261 / 783
» complexity 2006
Sort
View
IJCM
2010
80views more  IJCM 2010»
15 years 4 months ago
On implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
Stavros Konstantinidis, Nicolae Santean, S. Yu
IVC
2010
128views more  IVC 2010»
15 years 4 months ago
Online kernel density estimation for interactive learning
In this paper we propose a Gaussian-kernel-based online kernel density estimation which can be used for applications of online probability density estimation and online learning. ...
Matej Kristan, Danijel Skocaj, Ales Leonardis
JAIR
2010
115views more  JAIR 2010»
15 years 4 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
JAIR
2010
145views more  JAIR 2010»
15 years 4 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
JCSS
2010
112views more  JCSS 2010»
15 years 4 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn