252 search results - page 28 / 51 » On partitions of discrete boxes |
JCDCG
2000
Springer
13 years 11 months ago
2000
Springer
A k-dissection D of a polygon P, is a partition of P into a set of subpolygons {Q1, . . . , Qm} with disjoint interiors such that these can be reassembled to form k polygons P1, ....
FMSB
2008
13 years 9 months ago
2008
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...
JSCIC
2006
13 years 7 months ago
2006
An explicit time-stepping method is developed for adaptive solution of time-dependent partial differential equations with first order derivatives. The space is partitioned into bl...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this work, we are interested in multiprocessor energy efficient systems where task durations are not known in advance but are known stochastically. More precisely we consider g...
GLVLSI
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we propose novel architectural and design techniques for three-dimensional field-programmable gate arrays (3D FPGAs) with Through-Silicon Vias (TSVs). We develop a...