Sciweavers

1168 search results - page 76 / 234
» cases 2000
Sort
View
129
Voted
EJC
2008
15 years 2 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour
126
Voted
DM
2006
79views more  DM 2006»
15 years 2 months ago
Restricted even permutations and Chebyshev polynomials
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In sever...
Toufik Mansour
90
Voted
CGF
2000
72views more  CGF 2000»
15 years 2 months ago
Priority-Driven Acoustic Modeling for Virtual Environments
Geometric acoustic modeling systems spatialize sounds according to reverberation paths from a sound source to a receiver to give an auditory impression of a virtual 3D environment...
Patrick Min, Thomas A. Funkhouser
127
Voted
COLING
2000
15 years 2 months ago
Integrating Text Planning and Linguistic Choice Without Abandoning Modularity: The IGEN Generator
s; these annotations provide an abstract description of the effects of particular linguistic choices, allowing the planner to evaluate these choiceswithout needing any linguistic k...
Robert Rubinoff
114
Voted
COMBINATORICS
2000
82views more  COMBINATORICS 2000»
15 years 2 months ago
When Structures Are Almost Surely Connected
Let An denote the number of objects of some type of "size" n, and let Cn denote the number of these objects which are connected. It is often the case that there is a rel...
Jason P. Bell