Sciweavers

956 search results - page 4 / 192
» Packing Patterns into Words
Sort
View
JCT
2006
52views more  JCT 2006»
13 years 7 months ago
Further combinatorial constructions for optimal frequency-hopping sequences
Frequency-hopping multiple-access (FHMA) spread spectrum communication systems employing multiple frequency shift keying as data modulation technique were investigated by Fuji-Har...
Gennian Ge, Ryoh Fuji-Hara, Ying Miao
COMBINATORICS
2004
103views more  COMBINATORICS 2004»
13 years 7 months ago
On the Counting of Fully Packed Loop Configurations: Some New Conjectures
New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures a...
Jean-Bernard Zuber
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
COR
2008
105views more  COR 2008»
13 years 7 months ago
Minimizing the object dimensions in circle and sphere packing problems
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
Ernesto G. Birgin, F. N. C. Sobral
MOR
2000
162views more  MOR 2000»
13 years 7 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan