Sciweavers

CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 7 months ago
Analysis of Basis Pursuit Via Capacity Sets
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
Joseph Shtok, Michael Elad
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 7 months ago
Settling the Polynomial Learnability of Mixtures of Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
Ankur Moitra, Gregory Valiant
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
Symmetric M-tree
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. To date, no algorithm has been published for the corresp...
Alan P. Sexton, Richard Swinbank
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 7 months ago
Displacement Calculus
The Lambek calculus L provides a foundation for categorial grammar in the form of a logic of concatenation. But natural language is characterized by dependencies which may also be...
Glyn Morrill, Oriol Valentín
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 7 months ago
Real-Time Alert Correlation with Type Graphs
The premise of automated alert correlation is to accept that false alerts from a low level intrusion detection system are inevitable and use attack models to explain the output in ...
Gianni Tedesco, Uwe Aickelin
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 7 months ago
A General Framework for Graph Sparsification
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
Ramesh Hariharan, Debmalya Panigrahi
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 7 months ago
On two variations of identifying codes
Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and ...
Olivier Delmas, Sylvain Gravier, Mickaël Mont...
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
Finite Optimal Control for Time-Bounded Reachability in CTMDPs and Continuous-Time Markov Games
We establish the existence of optimal scheduling strategies for time-bounded reachability in continuous-time Markov decision processes, and of co-optimal strategies for continuous-...
Markus Rabe, Sven Schewe
CORR
2010
Springer
89views Education» more  CORR 2010»
13 years 7 months ago
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
David Doty
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 7 months ago
Price Trackers Inspired by Immune Memory
Abstract. In this paper we outline initial concepts for an immune inspired algorithm to evaluate price time series data. The proposed solution evolves a short term pool of trackers...
William O. Wilson, Phil Birkin, Uwe Aickelin