2612 search results - page 188 / 523 » Switching Graphs and Their Complexity |
130
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
134
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
164
click to vote
CCR
2004
15 years 4 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
153
click to vote
ESORICS
2011
Springer
14 years 4 months ago
2011
Springer
The use of server virtualization has been growing steadily, but many enterprises still are reluctant to migrate critical workloads to such infrastructures. One key inhibitor is the...
120
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
Occlusion is a difficult problem for appearance-based target tracking, especially when we need to track multiple targets simultaneously and maintain the target identities during t...