828 search results - page 45 / 166 » Simplicial Powers of Graphs |
115
click to vote
ENTCS
2007
15 years 1 months ago
2007
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
125
click to vote
SIGMETRICS
2010
ACM
15 years 8 days ago
2010
ACM
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
149
click to vote
MSWIM
2006
ACM
15 years 7 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
169
click to vote
CPAIOR
2010
Springer
14 years 12 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
152
click to vote
ICIP
2008
IEEE
16 years 3 months ago
2008
IEEE
Graph cuts have proven to be powerful tools in image segmentation. Previous graph cut research has proposed methods for cutting across large graphs constructed from multiple layer...