10988 search results - page 358 / 2198 » Algorithmic Folding Complexity |
132
Voted
IPM
2008
15 years 4 months ago
2008
In the last few years, there is an increasing interest to generate visual representations of very large scientific domains. A methodology based on the combined use of ISI
131
click to vote
PAMI
2008
15 years 4 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...
131
click to vote
DC
2000
15 years 4 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
111
click to vote
IJCAI
1989
15 years 6 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
159
click to vote
ISSAC
2004
Springer
15 years 10 months ago
2004
Springer
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...