893 search results - page 51 / 179 » Descent Theory for Schemes |
294
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
199
click to vote
SIGIR
2006
ACM
16 years 21 days ago
2006
ACM
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must ...
234
click to vote
TNN
2010
15 years 1 months ago
2010
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
194
click to vote
SPAA
2006
ACM
16 years 21 days ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
181
click to vote
SPAA
2006
ACM
16 years 21 days ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...