5946 search results - page 802 / 1190 » Visual requirement representation |
156
click to vote
SAS
2004
Springer
16 years 4 days ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
190
click to vote
SCOPES
2004
Springer
16 years 4 days ago
2004
Springer
Echo Instructions have recently been introduced to allow embedded processors to provide runtime decompression of LZ77-compressed programs at a minimal hardware cost compared to oth...
161
click to vote
UCS
2004
Springer
16 years 4 days ago
2004
Springer
Fiducial tags can be recognised successfully and decoded by computer vision systems in order to produce location information. We term a system dependable if its observable results ...
241
click to vote
WG
2004
Springer
16 years 4 days ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
167
click to vote
ICEIS
2003
IEEE
16 years 2 days ago
2003
IEEE
: This paper brings together two research areas, i.e. “Data Warehouses” and “Temporal Databases”, involving representation of time. Looking at temporal aspects within a dat...