The task of matching co-referent records is known among other names as record linkage. For large record-linkage problems, often there is little or no labeled data available, but u...
In any hierarchical radiosity method, the most expensive part is the evaluation of the visibility. Many methods use sampling and ray casting to determine this term. Space partitio...
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
In this work, to render at least 5123 voxel volumes in real-time, we have developed a sort-last parallel volume rendering method for distributed memory multiprocessors. Our sort-l...
Distributed intrusion detection systems are especially vulnerable to attacks because the components reside at a static location and are connected together into a hierarchical stru...