13603 search results - page 240 / 2721 » On the Computational Complexity of Cut-Reduction |
199
click to vote
DEXA
2008
Springer
15 years 8 months ago
2008
Springer
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
159
click to vote
NIPS
2000
15 years 8 months ago
2000
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
193
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
177
click to vote
IIE
2007
15 years 6 months ago
2007
Two years ago the Faculty of Mathematics and Informatics at Sofia University makes a decision to design a new series of Logo-based courses which make use of the modern technology....
173
click to vote
COGSCI
2004
15 years 6 months ago
2004
I show how a conversational process that takes simple, intuitively meaningful steps may be understood as a sophisticated computation that derives the richly detailed, complex repr...