Sciweavers

CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 11 months ago
Mosaic: Policy Homomorphic Network Extension
With the advent of large-scale cloud computing infrastructures, network extension has emerged as a major challenge in the management of modern enterprise networks. Many enterprise...
L. Erran Li, Michael F. Nowlan, Y. R. Yang
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 11 months ago
Classical BI: Its Semantics and Proof Theory
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...
James Brotherston, Cristiano Calcagno
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 11 months ago
Online Learning of Noisy Data with Kernels
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
CORR
2010
Springer
181views Education» more  CORR 2010»
13 years 11 months ago
Sparse Recovery with Orthogonal Matching Pursuit under RIP
This paper presents a new analysis for the orthogonal matching pursuit (OMP) algorithm. It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level O...
Tong Zhang
CORR
2010
Springer
47views Education» more  CORR 2010»
13 years 11 months ago
Robustness and Generalization
We derive generalization bounds for learning algorithms based on their robustness: the property that if a testing sample is "similar" to a training sample, then the test...
Huan Xu, Shie Mannor
CORR
2010
Springer
113views Education» more  CORR 2010»
13 years 11 months ago
Opaque sets
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
Adrian Dumitrescu, János Pach
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 11 months ago
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stab...
Ankan Saha, Ambuj Tewari
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 11 months ago
Simulations of Weighted Tree Automata
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Zoltán Ésik, Andreas Maletti