820 search results - page 46 / 164 » Inducing Temporal Graphs |
ICASSP
2011
IEEE
13 years 7 days ago
2011
IEEE
This work addresses the problem of deciding whether a set of realizations of a vector-valued time series with unknown temporal correlation are spatially correlated or not. Speciï¬...
EUROPAR
2009
Springer
14 years 1 months ago
2009
Springer
A high-level understanding of how an application executes and which performance characteristics it exhibits is essential in many areas of high performance computing, such as applic...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
CATS
2008
13 years 10 months ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
DAM
2008
13 years 8 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...