Sciweavers

257 search results - page 21 / 52
» Computability over The Partial Continuous Functionals
Sort
View
ICRA
2006
IEEE
161views Robotics» more  ICRA 2006»
14 years 3 months ago
Quadruped Robot Obstacle Negotiation via Reinforcement Learning
— Legged robots can, in principle, traverse a large variety of obstacles and terrains. In this paper, we describe a successful application of reinforcement learning to the proble...
Honglak Lee, Yirong Shen, Chih-Han Yu, Gurjeet Sin...
CP
2003
Springer
14 years 3 months ago
Constraint-Based Optimization with the Minimax Decision Criterion
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
14 years 10 months ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal
ICCV
2009
IEEE
15 years 2 months ago
Modeling Deformable Objects from a Single Depth Camera
We propose a novel approach to reconstruct complete 3D deformable models over time by a single depth camera, provided that most parts of the models are observed by the camera at...
Miao Liao, Qing Zhang, Huamin Wang, Ruigang Yang, ...
IJES
2006
99views more  IJES 2006»
13 years 10 months ago
Dynamic reconfiguration for management of radiation-induced faults in FPGAs
This paper describes novel methods of exploiting the partial, dynamic reconfiguration capabilities of Xilinx Virtex V1000 FPGAs to manage single-event upset (SEU) faults due to rad...
Maya Gokhale, Paul Graham, Michael J. Wirthlin, Da...