4761 search results - page 105 / 953 » Generalizing Boundary Points |
117
Voted
ICFEM
2000
Springer
15 years 7 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
115
Voted
CCCG
2007
15 years 5 months ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
100
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The goal of this paper is to define the n-connected regions in the Cartesian workspace of fully-parallel manipulators, i.e. the maximal regions where it is possible to execute po...
132
Voted
SIAMJO
2002
15 years 3 months ago
2002
We consider the interior-point approach to sensitivity analysis in linear programming developed by the authors. We investigate the quality of the interior-point bounds under degene...
137
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Silhouettes contain rich information about the shape of objects that can be used for recognition and classification. We present a novel approach that allows us to reliably compute...