773 search results - page 25 / 155 » Traversing the Machining Graph |
ICCAD
1994
IEEE
14 years 1 months ago
1994
IEEE
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
MOBICOM
2012
ACM
12 years 4 days ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
COLT
2005
Springer
14 years 3 months ago
2005
Springer
In the machine learning community it is generally believed that graph Laplacians corresponding to a finite sample of data points converge to a continuous Laplace operator if the s...
ECOOP
2006
Springer
14 years 1 months ago
2006
Springer
Adaptive Programming (AP) allows for the separate definition of data structures and traversals with attached computations, performed during the traversal, that operate on these dat...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...