Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...
Many object surfaces are composed of layers of different physical substances, known as layered surfaces. These surfaces, such as patinas, water colors, and wall paintings, have mo...
Tetsuro Morimoto, Robby Tan, Rei Kawakami, Katsush...
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
Ali Inan, Murat Kantarcioglu, Gabriel Ghinita, Eli...
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...