The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...
Orphan requests are a significant problem for multi-tier distributed systems since they adversely impact system correctness by violating the exactly-once semantics of application...
Many courses on the history of computing are designed for a general student audience, and as such, include fewer technical details than one might find in a typical CS course. Whi...
Geoffrey M. Draper, Robert R. Kessler, Richard F. ...
: An new object oriented development suite for data fusion is presented. It is shown how the various issues in the data fusion development like design, implementation, simulation a...