Sciweavers

266 search results - page 45 / 54
» Linear Recursion
Sort
View
117
Voted
NN
1997
Springer
174views Neural Networks» more  NN 1997»
15 years 6 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
118
Voted
ECAI
2006
Springer
15 years 5 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
105
Voted
ECSCW
2003
15 years 3 months ago
Customizable Collaborative Editor Relying on treeOPT Algorithm
Research in collaborative editing tends to have been undertaken in isolation rather than as part of a general information or application infrastructure. Our goal is to develop a un...
Claudia-Lavinia Ignat, Moira C. Norrie
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 2 months ago
On Graphs and Codes Preserved by Edge Local Complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
Lars Eirik Danielsen, Matthew G. Parker, Constanza...
87
Voted
CORR
2008
Springer
83views Education» more  CORR 2008»
15 years 2 months ago
Resource Allocation in Multiple Access Channels
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...