13784 search results - page 317 / 2757 » On Computing Functions with Uncertainty |
157
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...
163
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...
162
click to vote
CI
2004
15 years 6 months ago
2004
Although ceteris paribus preference statements concisely represent one natural class of preferences over outcomes or goals, many applications of such preferences require numeric u...
162
click to vote
CIKM
2007
Springer
16 years 24 days ago
2007
Springer
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
201
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: With the increased availability of high throughput data, such as DNA microarray data, researchers are capable of producing large amounts of biological data. During the...