Sciweavers

1483 search results - page 95 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
139
Voted
ICRA
2005
IEEE
136views Robotics» more  ICRA 2005»
15 years 12 months ago
A Circular Needle Path Planning Method for Suturing in Laparoscopic Surgery
— The work presented in this paper addresses the problem of the stitching task in laparoscopic surgery using a circular needle and a conventional 4 DOFs needle-holder. This task ...
Florent Nageotte, Philippe Zanne, Michel de Mathel...
CP
2003
Springer
15 years 11 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
CODES
1998
IEEE
15 years 10 months ago
Software timing analysis using HW/SW cosimulation and instruction set simulator
Timing analysis for checking satisfaction of constraints is a crucial problem in real-time system design. In some current approaches, the delay of software modules is precalculate...
Jie Liu, Marcello Lajolo, Alberto L. Sangiovanni-V...
CVPR
2008
IEEE
16 years 8 months ago
Global pose estimation using non-tree models
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...
Hao Jiang, David R. Martin
CORR
2008
Springer
85views Education» more  CORR 2008»
15 years 6 months ago
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
Ping Li