Sciweavers

3991 search results - page 95 / 799
» Bounding homogeneous models
Sort
View
SODA
1997
ACM
106views Algorithms» more  SODA 1997»
13 years 9 months ago
Optimal Bounds for Matching Routing on Trees
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
Louxin Zhang
IJCNN
2007
IEEE
14 years 2 months ago
Upper Bound on Pattern Storage in Feedforward Networks
—Starting from the strict interpolation equations for multivariate polynomials, an upper bound is developed for the number of patterns that can be memorized by a nonlinear feedfo...
Pramod Lakshmi Narasimha, Michael T. Manry, Franci...
ICPR
2008
IEEE
14 years 9 months ago
New extensions of the 3-simplex for exterior orientation
Object pose may be determined from a set of 2D image points and corresponding 3D model points, given the camera's intrinsic parameters. In this paper, two new exterior orient...
John Martin Steinbis, Tyrone Vincent, William A. H...
ESAW
2004
Springer
14 years 1 months ago
T-Compound Interaction and Overhearing Agents
Overhearing is an indirect interaction type that enacts agents to listen to direct interactions among other agents without taking explicit part in the exchanges. In this paper, we ...
Eric Platon, Nicolas Sabouret, Shinichi Honiden
DAGM
2001
Springer
14 years 14 days ago
Points, Lines, and Planes and Their Optimal Estimation
Abstract. We present a method for estimating unknown geometric entities based on identical, incident, parallel or orthogonal observed entities. These entities can be points and lin...
Stephan Heuel