990 search results - page 116 / 198 » Sub-Graphs of Complete Graph |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
SIAMDM
2011
13 years 2 months ago
2011
Abstract. A generalized Davenport–Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental proble...
JMLR
2010
13 years 2 months ago
2010
We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relatio...
CP
2011
Springer
12 years 7 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
PAMI
2012
11 years 10 months ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...