1243 search results - page 101 / 249 » Generating Trees on Multisets |
AAIM
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
EMNLP
2007
14 years 11 months ago
2007
This paper compares a deep and a shallow processing approach to the problem of classifying a sentence as grammatically wellformed or ill-formed. The deep processing approach uses ...
DM
2008
14 years 10 months ago
2008
Catalan numbers C(n) = 1 n+1 2n n enumerate binary trees and Dyck paths. The distribution of paths with respect to their number k of factors is given by ballot numbers B(n, k) = n-...
SAC
2002
ACM
14 years 9 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
102
click to vote
FBIT
2007
IEEE
15 years 4 months ago
2007
IEEE
—Standard genetic programming genotypes are generally highly disorganized and poorly structured, with little code replication. This is also true of existing developmental genetic...