Sciweavers

614 search results - page 50 / 123
» Computational Complexity of Multi-way, Dataflow Constraint P...
Sort
View
IJCAI
1989
13 years 9 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
CVPR
2010
IEEE
14 years 4 months ago
Tracking People Interacting with Objects
While the problem of tracking 3D human motion has been widely studied, most approaches have assumed that the person is isolated and not interacting with the environment. Environme...
Hedvig Kjellstrom, Michael Black, Danica Kragic
CORR
2002
Springer
135views Education» more  CORR 2002»
13 years 7 months ago
Minimal-Change Integrity Maintenance Using Tuple Deletions
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are li...
Jan Chomicki, Jerzy Marcinkowski
ICRA
2007
IEEE
122views Robotics» more  ICRA 2007»
14 years 2 months ago
Exploiting the Information at the Loop Closure in SLAM
— This paper presents two methods able to exploit the information at the loop closure in the SLAM problem. Both methods have three fundamental advantages. The first one is that ...
Agostino Martinelli, Roland Siegwart
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
13 years 7 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri