• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 281
Next 10 →

An Application of Catalan Numbers on Cayley Tree of Order 2: Single Polygon Counting

by C. H. Pah
"... Abstract. In this paper, we consider a problem on finding the number of different single connected component containing a fixed root for a given number of vertices on semi-infinite Cayley tree. The solution of this problem is the well known Catalan numbers. The result is then extended to the complet ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. In this paper, we consider a problem on finding the number of different single connected component containing a fixed root for a given number of vertices on semi-infinite Cayley tree. The solution of this problem is the well known Catalan numbers. The result is then extended

Shape quantization and recognition with randomized trees

by Yali Amit, Donald Geman - NEURAL COMPUTATION , 1997
"... We explore a new approach to shape recognition based on a virtually infinite family of binary features ("queries") of the image data, designed to accommodate prior information about shape invariance and regularity. Each query corresponds to a spatial arrangement ofseveral local topographic ..."
Abstract - Cited by 263 (18 self) - Add to MetaCart
We explore a new approach to shape recognition based on a virtually infinite family of binary features ("queries") of the image data, designed to accommodate prior information about shape invariance and regularity. Each query corresponds to a spatial arrangement ofseveral local

Cayley Tree

by Javier M. Magán, Auditya Sharma
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Cayley tree

by Cyril Marzouk
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

2 Semi-infinite paths of the 2d-Radial Spanning Tree

by François Baccelli, David Coupier, Viet Chi Tran , 2014
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Random spanning trees of Cayley graphs and an associated compactification of semigroups

by Steven N. Evans , 1998
"... A sequential construction of a random spanning tree for the Cayley graph of a finitely generated, countably infinite subsemigroup V of a group G is considered. At stage n, the spanning tree T is approximated by a finite tree Tn rooted at the identity. The approximation Tn+1 is obtained by connecting ..."
Abstract - Add to MetaCart
A sequential construction of a random spanning tree for the Cayley graph of a finitely generated, countably infinite subsemigroup V of a group G is considered. At stage n, the spanning tree T is approximated by a finite tree Tn rooted at the identity. The approximation Tn+1 is obtained

Lattice Vibration of the Cayley Tree

by Koh W Ada, Takehiko Fujita, Takas Hi As Ahi , 1977
"... Vibrational properties of a Cayley-tree-type system are investigated: Normal modes and squared frequency spectral densities are calculated for infinite homogeneous monatomic and diatomic Cayley trees. Effect of an impurity is then investigated. Existence of a virtual localized mode is thereby discus ..."
Abstract - Add to MetaCart
Vibrational properties of a Cayley-tree-type system are investigated: Normal modes and squared frequency spectral densities are calculated for infinite homogeneous monatomic and diatomic Cayley trees. Effect of an impurity is then investigated. Existence of a virtual localized mode is thereby

ZEBRA-PERCOLATION ON CAYLEY TREES

by D. Gandolfo, U. A. Rozikov, J. Ruiz
"... Abstract. We consider Bernoulli (bond) percolation with parameter p on the Cayley tree of order k. We introduce the notion of zebra-percolation that is percolation by paths of alternating open and closed edges. In contrast with standard percolation with critical threshold at pc = 1/k, we show that z ..."
Abstract - Add to MetaCart
Abstract. We consider Bernoulli (bond) percolation with parameter p on the Cayley tree of order k. We introduce the notion of zebra-percolation that is percolation by paths of alternating open and closed edges. In contrast with standard percolation with critical threshold at pc = 1/k, we show

CELLULAR AUTOMATA ON CAYLEY TREE

by Hasan Akin
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Random Colorings of a Cayley Tree

by Graham R. Brightwell, Peter Winkler - IN CONTEMPORARY COMBINATORICS, B. BOLLOBAS, ED., BOLYAI SOCIETY MATHEMATICAL STUDIES, 2002 , 2000
"... Probability measures on the space of proper colorings of a Cayley tree (that is, an infinite regular connected graph with no cycles) are of interest not only in combinatorics but also in statistical physics, as states of the antiferromagnetic Potts model at zero temperature, on the "Bethe latti ..."
Abstract - Cited by 22 (1 self) - Add to MetaCart
Probability measures on the space of proper colorings of a Cayley tree (that is, an infinite regular connected graph with no cycles) are of interest not only in combinatorics but also in statistical physics, as states of the antiferromagnetic Potts model at zero temperature, on the "
Next 10 →
Results 1 - 10 of 281
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University