Sciweavers

3495 search results - page 245 / 699
» On the random satisfiable process
Sort
View
ICRA
2002
IEEE
223views Robotics» more  ICRA 2002»
16 years 5 days ago
Dynamic Motion Planning Whole Arm Grasp Systems Based on Switching Contact Modes
We present motion planning for dexterous manipulation by whole arm grasp system based on switching contact modes. Motion planning for such a system should consider changing dynami...
Masahito Yashima, Hideya Yamaguchi
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 11 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 11 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
ASIACRYPT
2009
Springer
15 years 11 months ago
Proofs of Storage from Homomorphic Identification Protocols
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
Giuseppe Ateniese, Seny Kamara, Jonathan Katz
COMPSAC
2009
IEEE
15 years 11 months ago
Tamper Resistance for Software Defined Radio Software
The security of software defined radio (SDR) software is essential to the trustworthiness of the overall radio system. When designing and developing security solutions for SDR sof...
Shucai Xiao, Jung-Min Park, Yanzhu Ye