Sciweavers

828 search results - page 45 / 166
» Simplicial Powers of Graphs
Sort
View
ENTCS
2007
112views more  ENTCS 2007»
13 years 8 months ago
Structure and Properties of Traces for Functional Programs
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...
Olaf Chitil, Yong Luo
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 7 months ago
On random walks in direction-aware network problems
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...
Ali Tizghadam, Alberto Leon-Garcia
MSWIM
2006
ACM
14 years 2 months ago
The power of choice in random walks: an empirical study
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...
Chen Avin, Bhaskar Krishnamachari
CPAIOR
2010
Springer
13 years 6 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
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...
Peter J. Stuckey
ICIP
2008
IEEE
14 years 10 months ago
Live video object tracking and segmentation using graph cuts
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...
Zachary A. Garrett, Hideo Saito