2314 search results - page 380 / 463 » Minimal Partitions of a Graph |
109
click to vote
VLSID
2002
IEEE
16 years 3 months ago
2002
IEEE
| This paper reports the design of BIST structures for sequential machines. Testability of an FSM is limited due to the fact that some machine states remain unreachable and some ac...
106
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
119
click to vote
ICFP
2001
ACM
16 years 3 months ago
2001
ACM
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...
118
Voted
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
129
Voted
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...