4298 search results - page 409 / 860 » Computing at the top of the world |
152
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
155
click to vote
ECEASST
2008
15 years 7 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
207
click to vote
ENTCS
2008
15 years 7 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
191
click to vote
CONCURRENCY
2006
15 years 7 months ago
2006
vices provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. In this scenario, applications, like sc...
189
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...