Sciweavers

7167 search results - page 1002 / 1434
» Answer Set Programming
Sort
View
MICRO
2010
IEEE
153views Hardware» more  MICRO 2010»
15 years 5 months ago
Scalable Speculative Parallelization on Commodity Clusters
While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In...
Hanjun Kim, Arun Raman, Feng Liu, Jae W. Lee, Davi...
JMLR
2012
13 years 10 months ago
Maximum Margin Temporal Clustering
Temporal Clustering (TC) refers to the factorization of multiple time series into a set of non-overlapping segments that belong to k temporal clusters. Existing methods based on e...
Minh Hoai Nguyen, Fernando De la Torre
271
Voted
JMLR
2012
13 years 10 months ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...
JMLR
2012
13 years 10 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
222
Voted
JMLR
2012
13 years 10 months ago
A metric learning perspective of SVM: on the relation of LMNN and SVM
Support Vector Machines, SVMs, and the Large Margin Nearest Neighbor algorithm, LMNN, are two very popular learning algorithms with quite different learning biases. In this paper...
Huyen Do, Alexandros Kalousis, Jun Wang, Adam Wozn...
« Prev « First page 1002 / 1434 Last » Next »