2356 search results - page 346 / 472 » Characterizations of postman sets |
123
Voted
ECHT
1994
15 years 8 months ago
1994
In semantically rich hypertexts it is attractive to enable presentation of a network of nodes and links at different levels action. It is also important that the user can interact...
162
click to vote
ICDE
1992
IEEE
15 years 8 months ago
1992
IEEE
Contrary to popular belief, relation schemes in good classical normal forms are not necessarily devoid of redundancies. This arises from the fact that classical data dependencies ...
142
click to vote
STACS
1994
Springer
15 years 8 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
116
click to vote
SPAA
1990
ACM
15 years 8 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
154
click to vote
CASES
2007
ACM
15 years 8 months ago
2007
ACM
Many MPSoC applications are loop-intensive and amenable to automatic parallelization with suitable compiler support. One of the key components of any compiler-parallelized code is...