5350 search results - page 335 / 1070 » Space and time in eco-ontologies |
172
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
181
Voted
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
170
click to vote
DATE
2006
IEEE
16 years 26 days ago
2006
IEEE
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
157
Voted
ITCC
2005
IEEE
16 years 12 days ago
2005
IEEE
: In this paper, we propose a methodology based on genetic programming to automatically generate hardware designs of substitution boxes necessary for many cryptosystems such as DES...
181
click to vote
WG
2005
Springer
16 years 8 days ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...