462 search results - page 70 / 93 » Covering a Tree by a Forest |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
ISSRE
2007
IEEE
13 years 9 months ago
2007
IEEE
Using a specific machine learning technique, this paper proposes a way to identify suspicious statements during debugging. The technique is based on principles similar to Tarantul...
DAM
2010
13 years 7 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
TIP
2008
13 years 7 months ago
2008
The present paper contributes two novel techniques in the context of image restoration by nonlocal filtering. Firstly, we introduce an efficient implementation of the nonlocal mean...