16666 search results - page 2838 / 3334 » Descriptive and Computational Complexity |
165
click to vote
CALCO
2005
Springer
16 years 15 days ago
2005
Springer
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
163
click to vote
CIE
2005
Springer
16 years 15 days ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
160
click to vote
COLT
2005
Springer
16 years 15 days ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
194
click to vote
DCOSS
2005
Springer
16 years 15 days ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
173
click to vote
DEXA
2005
Springer
16 years 15 days ago
2005
Springer
Abstract. Non-trivial retrieval applications involve complex computations on large multi-dimensional datasets. These should, in principle, benefit from the use of relational datab...