11151 search results - page 1899 / 2231 » On the Complexity of Model Expansion |
166
click to vote
ASPDAC
2004
ACM
16 years 5 days ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
155
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
160
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
168
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
173
click to vote
CSCW
2004
ACM
16 years 5 days ago
2004
ACM
This paper considers the complexity of measuring the return on investment for technology adoption. A brief case study of technology adoption in a large design and construction fir...