Sciweavers

1952 search results - page 364 / 391
» Complete partitions of graphs
Sort
View
SIAMDM
2011
14 years 11 months ago
Origins of Nonlinearity in Davenport-Schinzel Sequences
Abstract. A generalized Davenport–Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental proble...
Seth Pettie
JMLR
2010
157views more  JMLR 2010»
14 years 11 months ago
Combining Experiments to Discover Linear Cyclic Models with Latent Variables
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...
Frederick Eberhardt, Patrik O. Hoyer, Richard Sche...
CP
2011
Springer
14 years 4 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
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...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
PAMI
2012
13 years 6 months ago
Angular Embedding: A Robust Quadratic Criterion
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...
Stella Yu
TON
2012
13 years 6 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...