Sciweavers

962 search results - page 48 / 193
» Some Reducibilities on Regular Sets
Sort
View
FMSD
2008
110views more  FMSD 2008»
13 years 7 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
CSDA
2011
13 years 2 months ago
Hierarchical multilinear models for multiway data
Reduced-rank decompositions provide descriptions of the variation among the elements of a matrix or array. In such decompositions, the elements of an array are expressed as produc...
Peter D. Hoff
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
ECAI
2008
Springer
13 years 9 months ago
Theoretical Study of Ant-based Algorithms for Multi-Agent Patrolling
This paper addresses the multi-agent patrolling problem, which consists for a set of autonomous agents to visit all the places of an unknown environment as regularly as possible. T...
Arnaud Glad, Olivier Simonin, Olivier Buffet, Fran...
CORR
2007
Springer
112views Education» more  CORR 2007»
13 years 7 months ago
Learning from compressed observations
— The problem of statistical learning is to construct a predictor of a random variable Y as a function of a related random variable X on the basis of an i.i.d. training sample fr...
Maxim Raginsky