It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
In this paper we will briefly describe the approaches taken by the Berkeley Cheshire Group for the GikiCLEF task of the QA track. Because the task was intended to model some aspec...
Potentially, the advantages of marker-passing over local connectionist techniques for associa tive inference are (1) the ability to differen tiate variable bindings, and (2) r...
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...