Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
We consider the least-square linear regression problem with regularization by the 1-norm, a problem usually referred to as the Lasso. In this paper, we present a detailed asymptot...
This paper deals with the problem of regularizing noisy fields of diffusion tensors, considered as symmetric and semi-positive definite ? ? ? matrices (as for instance 2D structur...
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...