6142 search results - page 176 / 1229 » The Complexity of Partition Functions |
168
Voted
SIAMCOMP
2002
15 years 3 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
123
Voted
SLOGICA
2008
15 years 1 months ago
2008
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
113
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
113
click to vote
PAMI
2008
15 years 3 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
135
click to vote
AOSD
2010
ACM
15 years 10 months ago
2010
ACM
The development of complex software requires the implementation of functions over a variety of recursively defined data structures. The design (and modeling) of structures can it...