Sciweavers

265 search results - page 15 / 53
» Properties and computations of matrix pseudospectra
Sort
View
AUTOMATICA
2006
87views more  AUTOMATICA 2006»
14 years 10 months ago
Modeling continuous-time processes via input-to-state filters
A direct algorithm to estimate continuous-time ARMA (CARMA) models is proposed in this paper. In this approach, we first pass the observed data through an input-to-state filter an...
Kaushik Mahata, Minyue Fu
CORR
2012
Springer
183views Education» more  CORR 2012»
13 years 5 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
SOFSEM
2009
Springer
15 years 6 months ago
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
Nguyen Kim Thang
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
15 years 7 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
CORR
2010
Springer
198views Education» more  CORR 2010»
14 years 6 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...