23119 search results - page 4454 / 4624 » From Domain to Requirements |
306
click to vote
LCC
1994
15 years 10 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
160
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
187
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
Image-space simplifications have been used to accelerate the calculation of computer graphic images since the dawn of visual simulation. Texture mapping has been used to provide a...
193
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
210
click to vote
SMA
1993
ACM
15 years 10 months ago
1993
ACM
Form features present a rather attractive building block in computer-aided design environments for a variety of applications, providing the embodiment of engineering semantics in ...