10608 search results - page 695 / 2122 » Complexity of O'Hara's Algorithm |
231
click to vote
AEI
1999
15 years 7 months ago
1999
Design synthesis represents a highly complex task in the field of industrial design. The main difficulty in automating it is the definition of the design and performance spaces, i...
200
click to vote
IPL
2002
15 years 7 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
164
click to vote
GI
2010
Springer
15 years 6 months ago
2010
Springer
: A recurring manual task in data integration or ontology alignment is finding mappings between complex schemas. In order to reduce the manual effort, many matching algorithms for ...
195
click to vote
ICRA
2010
IEEE
15 years 6 months ago
2010
IEEE
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
204
click to vote
BMVC
2010
15 years 5 months ago
2010
Local coordinate coding has recently been introduced to learning visual feature dictionary and achieved top level performance for object recognition. However, the computational co...