11345 search results - page 439 / 2269 » Foundations of Computer Science |
360
click to vote
DIMACS
1996
15 years 8 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
192
click to vote
IJRR
2002
15 years 6 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
188
click to vote
DAC
2005
ACM
15 years 8 months ago
2005
ACM
The need to reuse the performance macromodels of an analog circuit topology challenges existing regression based modeling techniques. A model of good reusability should have a num...
168
click to vote
AE
2001
Springer
15 years 11 months ago
2001
Springer
This is a time of increasing interdisciplinary research. Computer science is learning more from biology every day, enabling a plethora of new software techniques to flourish. And b...
209
click to vote
SIGITE
2005
ACM
16 years 12 days ago
2005
ACM
The direct experience we had with teaching a summer pre-college computing course in which we adopted an online portfolio approach has led us to consider the use of online portfoli...