7106 search results - page 1039 / 1422 » Restricted Complexity, General Complexity |
168
click to vote
DATE
1999
IEEE
15 years 11 months ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
206
click to vote
EUROMICRO
1999
IEEE
15 years 11 months ago
1999
IEEE
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
179
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
216
click to vote
SMA
1999
ACM
15 years 11 months ago
1999
ACM
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...
157
click to vote
VRST
1999
ACM
15 years 11 months ago
1999
ACM
As immersive virtual environment (VE) applications become more complex, it is clear that we need a rm understanding of the principles of VE interaction. In particular, designers n...