8824 search results - page 201 / 1765 » On the Complexity of Real Functions |
155
click to vote
MFCS
2004
Springer
15 years 12 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...
158
click to vote
PAMI
2008
15 years 6 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...
174
click to vote
AOSD
2010
ACM
16 years 1 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...
150
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
174
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
The aim of this work is to propose an adaptation of optimal path based interactive tools for image segmentation (related to Live-Wire [12] and Intelligent Scissors [18] approaches)...