882 search results - page 158 / 177 » On the Hardness of Graph Isomorphism |
PODC
2009
ACM
14 years 9 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
ECCV
2006
Springer
14 years 10 months ago
2006
Springer
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
requirement. Furthermore, programming using sequence constructs normally produce nested structures and The current approachfor modeling synchronization in scattered code, especiall...
SIGSOFT
2003
ACM
14 years 9 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
SIGSOFT
2002
ACM
14 years 9 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...