Sciweavers

4488 search results - page 222 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 5 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
IROS
2008
IEEE
121views Robotics» more  IROS 2008»
15 years 10 months ago
Online ZMP sampling search for biped walking planning
— 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 ...
Jinsu Liu, Manuela M. Veloso
CVPR
2010
IEEE
15 years 12 months ago
Estimating Optical Properties of Layered Surfaces Using the Spider 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...
EDBT
2010
ACM
181views Database» more  EDBT 2010»
15 years 2 months ago
Private record matching using differential privacy
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...
NIPS
2007
15 years 5 months ago
Random Sampling of States in Dynamic Programming
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...
Christopher G. Atkeson, Benjamin Stephens