Sciweavers

19798 search results - page 324 / 3960
» Is Structural Subtyping Useful
Sort
View
TCS
2011
14 years 10 months ago
Correctness of linear logic proof structures is NL-complete
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
Paulin Jacobé de Naurois, Virgile Mogbil
137
Voted
SIAMMAX
2010
224views more  SIAMMAX 2010»
14 years 10 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu
ICML
2007
IEEE
16 years 4 months ago
Incremental Bayesian networks for structure prediction
We propose a class of graphical models appropriate for structure prediction problems where the model structure is a function of the output structure. Incremental Sigmoid Belief Ne...
Ivan Titov, James Henderson
163
Voted
AUSAI
2009
Springer
15 years 10 months ago
A Graph Distance Based Structural Clustering Approach for Networks
In the era of information explosion, structured data emerge on a large scale. As a description of structured data, network has drawn attention of researchers in many subjects. Netw...
Xin Su, Chunping Li
113
Voted
ISAAC
2007
Springer
108views Algorithms» more  ISAAC 2007»
15 years 9 months ago
Checking Value-Sensitive Data Structures in Sublinear Space
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
Michael T. Goodrich, Jonathan Z. Sun