Sciweavers

1139 search results - page 178 / 228
» Bounded Ideation Theory
Sort
View
NIPS
2001
13 years 9 months ago
Algorithmic Luckiness
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
Ralf Herbrich, Robert C. Williamson
NIPS
2001
13 years 9 months ago
Online Learning with Kernels
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
Jyrki Kivinen, Alex J. Smola, Robert C. Williamson
ATAL
2010
Springer
13 years 8 months ago
Resource-bounded alternating-time temporal logic
Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools ...
Natasha Alechina, Brian Logan, Nguyen Hoang Nga, A...
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 8 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
AI
2008
Springer
13 years 7 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson