828 search results - page 64 / 166 » Simplicial Powers of Graphs |
ESOP
2000
Springer
14 years 10 days ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
CG
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
CPHYSICS
2007
13 years 8 months ago
2007
We investigate the financial network of the Korea Stock Exchange (KSE) using numerical simulations and scaling arguments. The frequency of degree and the edge density for a real ...
ADAEUROPE
2008
Springer
14 years 3 months ago
2008
Springer
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...
ICIP
2009
IEEE
13 years 6 months ago
2009
IEEE
The non-local means filter is one of powerful denoising methods which allows participation of far, but proper pixels in the denoising process. Although the weights of non-similar ...