Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
Fingerprint distortion changes both the geometric position and orientation of minutiae, and leads to difficulties in establishing a match among multiple impressions acquired from ...
In an increasingly multilingual world, it is critical that information management tools organically support the simultaneous use of multiple natural languages. A pre-requisite for ...
Composing existing Web services to deliver new functionality is a difficult problem as it involves resolving semantic, syntactic and structural differences among the interfaces of...