Sciweavers

312 search results - page 33 / 63
» The Analysis of a Probabilistic Approach to Nearest Neighbor...
Sort
View
RECOMB
2003
Springer
14 years 7 months ago
Approximation of protein structure for fast similarity measures
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...
Fabian Schwarzer, Itay Lotan
AAAI
2010
13 years 9 months ago
g-Planner: Real-time Motion Planning and Global Navigation using GPUs
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...
Jia Pan, Christian Lauterbach, Dinesh Manocha
CLEF
2009
Springer
13 years 8 months ago
Interactive Probabilistic Search for GikiCLEF
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...
Ray R. Larson
IJCAI
1989
13 years 8 months ago
A Probabilistic Approach to Marker Propagation
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...
Dekai Wu
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 11 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
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...