Sciweavers

1124 search results - page 196 / 225
» Generalized Conditioning in Neighbourhood Models
Sort
View
SIAMJO
2011
14 years 1 months ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...
102
Voted
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
15 years 11 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
POPL
2008
ACM
15 years 11 months ago
A theory of platform-dependent low-level software
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
Marius Nita, Dan Grossman, Craig Chambers
208
Voted
POPL
2006
ACM
15 years 11 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
AMAI
1999
Springer
14 years 10 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen