1368 search results - page 19 / 274 » Avoiding Simplicity Is Complex |
CVPR
2006
IEEE
14 years 12 months ago
2006
IEEE
We introduce Hierarchical Procrustes Matching (HPM), a segment-based shape matching algorithm which avoids problems associated with purely global or local methods and performs wel...
RT
2001
Springer
14 years 2 months ago
2001
Springer
We present a new sampling method for procedural and complex geometries, which allows interactive point-based modeling and rendering of such scenes. For a variety of scenes, object-...
JITECH
2010
13 years 8 months ago
2010
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
LPNMR
2007
Springer
14 years 4 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
FSTTCS
2005
Springer
14 years 3 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...