903 search results - page 86 / 181 » On the reduction of a random basis |
160
click to vote
FLOPS
2004
Springer
15 years 11 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
140
click to vote
ADBIS
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
129
click to vote
FPL
2009
Springer
15 years 11 months ago
2009
Springer
The reconfigurable mesh model for massively parallel computing has recently been rediscovered and proposed as the basis of a practical many-core architecture. With this paper, we...
171
click to vote
FTP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
182
click to vote
POPL
1997
ACM
15 years 9 months ago
1997
ACM
We propose a new computation model which combines the operational principles of functional languages (reduction), logic languages (non-deterministic search for solutions), and int...