We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
Volunteer-based grid computing resources are characteristically volatile and frequently become unavailable due to the autonomy that owners maintain over them. This resource volati...
We propose a generic computational framework for maintaining a discrete geometric structure deļ¬ned by a collection of static and mobile objects. We assume that the mobile object...
David M. Mount, Nathan S. Netanyahu, Christine D. ...
Abstract-- Cisco's NetFlow Collector (NFC) is a powerful example of a real-world product that supports multiple aggregate queries over a continuous stream of IP flow records. ...
Kanthi Nagaraj, K. V. M. Naidu, Rajeev Rastogi, Sc...