3008 search results - page 291 / 602 » Independence in connected graphs |
172
click to vote
CLUSTER
2005
IEEE
16 years 10 days ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
169
click to vote
AUSAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Graph-based representations have been used with considercess in computer vision in the abstraction and recognition of object shape and scene structure. Despite this, the ...
149
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The ability to detect weak distributed activation patterns in networks is critical to several applications, such as identifying the onset of anomalous activity or incipient conges...
203
click to vote
JMLR
2008
15 years 6 months ago
2008
Pointwise consistent, feasible procedures for estimating contemporaneous linear causal structure from time series data have been developed using multiple conditional independence ...
188
click to vote
IGPL
2002
15 years 6 months ago
2002
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...