3268 search results - page 407 / 654 » The hub number of a graph |
165
click to vote
SAC
2004
ACM
16 years 12 hour ago
2004
ACM
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
191
click to vote
INFOVIS
1999
IEEE
15 years 11 months ago
1999
IEEE
A new method is presented to get insight into univariate time series data. The problem addressed here is how to identify patterns and trends on multiple time scales (days, weeks, ...
161
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
135
click to vote
ICCAD
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...
161
click to vote
VLSID
1996
IEEE
15 years 10 months ago
1996
IEEE
Existing systolic architectures for the LMS algorithm with delayed coeficient adaptation have large adaptation delay and hence degraded convergence behaviour. This paper presents ...