773 search results - page 61 / 155 » Traversing the Machining Graph |
CORR
2011
Springer
14 years 4 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...
ICPP
1999
IEEE
15 years 2 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
106
click to vote
COMBINATORICA
2010
14 years 7 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...