Sciweavers

4670 search results - page 614 / 934
» Testing that distributions are close
Sort
View
MDM
2009
Springer
116views Communications» more  MDM 2009»
16 years 1 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
AINA
2008
IEEE
16 years 1 months ago
Protein Structure Comparison and Alignment Using Residue Contexts
We introduce a method for comparing protein structures using the notion of residue contexts based on protein Cα-atom backbones. The residue context is derived from the set of vec...
Tobias Sayre, Rahul Singh
DEXAW
2008
IEEE
204views Database» more  DEXAW 2008»
16 years 1 months ago
Particle Swarm Optimization Using Adaptive Mutation
Two new variants of Particle Swarm Optimization (PSO) called AMPSO1 and AMPSO2 are proposed for global optimization problems. Both the algorithms use adaptive mutation using Beta ...
Millie Pant, Radha Thangaraj, Ajith Abraham
GLOBECOM
2008
IEEE
16 years 1 months ago
Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver
—We propose a non-coherent receiver for the fixed detect-and-forward relay channel and derive a closed-form tight upper bound on its bit error probability in Rayleigh fading cha...
Michael R. Souryal, Huiqing You
ICASSP
2008
IEEE
16 years 1 months ago
Adaptable K-nearest neighbor for image interpolation
A variant of the k-nearest neighbor algorithm is proposed for image interpolation. Instead of using a static volume or static k, the proposed algorithm determines a dynamic k that...
Kenta S. Ni, Truong Q. Nguyen