1493 search results - page 115 / 299 » Local resilience of graphs |
IJCAI
2003
13 years 9 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In video surveillance, the size of face images is very small. However, few works have been done to investigate scale invariant face recognition. Our experiments on appearance-base...