Sciweavers

348 search results - page 53 / 70
» di 2008
Sort
View
DM
2000
89views more  DM 2000»
13 years 7 months ago
Some counting problems related to permutation groups
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
Peter J. Cameron
DM
2006
83views more  DM 2006»
13 years 7 months ago
Language structure of pattern Sturmian words
Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...
Teturo Kamae, Hui Rao, Bo Tan, Yu-Mei Xue
JCT
2008
62views more  JCT 2008»
13 years 7 months ago
Linked graphs with restricted lengths
A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2, . . . , xk, y1, y2, . . . , yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,...
Guantao Chen, Yuan Chen, Shuhong Gao, Zhiquan Hu
DCG
2002
71views more  DCG 2002»
13 years 7 months ago
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
The volume of the n-dimensional polytope nx := fy 2 Rn : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := x1; : : : ; xn with xi 0 for all i de nes a polyn...
Richard P. Stanley, Jim Pitman
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 7 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...