1819 search results - page 21 / 364 » Computability and Representations of the Zero Set |
72
Voted
ICRA
1994
IEEE
15 years 1 months ago
1994
IEEE
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
TCAD
1998
14 years 9 months ago
1998
—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general term...
BMVC
2001
15 years 1 days ago
2001
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...
131
Voted
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Illumination conditions cause problems for many computer vision algorithms. Inparticular, shadows in an image can cause segmentation, tracking, or recognition algorithms to fail. I...
AMAI
2002
Springer
14 years 9 months ago
2002
Springer
act It is well-established that a multi-layer perceptron (MLP) with a single hidden layer of N neurons and an activation function bounded by zero at negative infinity and one at in...