3040 search results - page 36 / 608 » Independent Natural Extension |
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
We propose a convex optimization method for maximum likelihood estimation of autoregressive models, subject to conditional independence constraints. This problem is an extension t...
DC
2010
13 years 8 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
TON
2012
11 years 10 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...
PDP
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same...