Sciweavers

561 search results - page 21 / 113
» A Strategy for the Computation of Conditional Answers
Sort
View
CCCG
1996
13 years 9 months ago
Heuristic Motion Planning with Many Degrees of Freedom
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...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
FOCS
2009
IEEE
14 years 2 months ago
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
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ļ...
Yi Deng, Vipul Goyal, Amit Sahai
CCGRID
2010
IEEE
13 years 9 months ago
Availability Prediction Based Replication Strategies for Grid Environments
Volunteer-based grid computing resources are characteristically volatile and frequently become unavailable due to the autonomy that owners maintain over them. This resource volati...
Brent Rood, Michael J. Lewis
COMPGEOM
2004
ACM
14 years 1 months ago
A computational framework for incremental motion
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. ...
ICDE
2008
IEEE
188views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Aggregate Computation over Data Streams
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...