820 search results - page 77 / 164 » Inducing Temporal Graphs |
107
click to vote
GBRPR
2009
Springer
15 years 9 months ago
2009
Springer
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
118
click to vote
JGT
2007
15 years 2 months ago
2007
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
108
Voted
TVLSI
2002
15 years 2 months ago
2002
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
124
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...
125
Voted
ICCD
2006
IEEE
15 years 11 months ago
2006
IEEE
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...