• 沒有找到結果。

[PDF] Top 20 Winner-Update Algorithm for Nearest Neighbor Search

Has 10000 "Winner-Update Algorithm for Nearest Neighbor Search" found on our website. Below are the top 20 most common "Winner-Update Algorithm for Nearest Neighbor Search".

Winner-Update Algorithm for Nearest Neighbor Search

Winner-Update Algorithm for Nearest Neighbor Search

... used as the distance measure and the goal is to find the nearest neighbor. The exhaustive search algorithm and the winner-update algorithm are implemented on a Sun Ultra-1 [r] ... See full document

4

Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree

Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree

... proposed algorithm for nearest neighbor ...final search re- sult of the nearest neighbor but only ...code for the data transformation, which are to be added to the ... See full document

8

Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

... Instructor, Department of Health Care Manageme 訓 , National Taipei College of Nursing: Graduate Student, Graduate Institute of Health Care Organization Administration, College of Public [r] ... See full document

11

Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

... of nearest neighbor search by applying data trans- ...identical for different samples calculated in this subspace, which will not help much in the search for nearest ... See full document

16

DDS: an efficient dynamic dimension selection algorithm for nearest neighbor search in high dimensions

DDS: an efficient dynamic dimension selection algorithm for nearest neighbor search in high dimensions

... Our approach is devoted to improve the efficiency of exhaustive search based on dynamically filtering out redundant dimensions for reading and calculating in high [r] ... See full document

4

Fast and Versatile Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree Yong-Sheng Chen

Fast and Versatile Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree Yong-Sheng Chen

... identical for different samples calculated in this subspace, which will not help much in the search for nearest ...final search result, for the Euclidean distances calculated in ... See full document

41

Fast Block Matching Algorithm Based on the Winner-Update Strategy

Fast Block Matching Algorithm Based on the Winner-Update Strategy

... variations for adapting to different applica- tions. For example, in the applications of on-line video com- pression, such as video conference and video phone, satisfying the time constraint is more ... See full document

11

Gene selection and sample classification on microarray data based on adaptive genetic algorithm / k-nearest neighbor method

Gene selection and sample classification on microarray data based on adaptive genetic algorithm / k-nearest neighbor method

... use for high-dimensional space. AGA is a search tool of machine learning and imitates the biological system to find the near optimal solution, so it is suitable to analyze high-dimen- sional, noisy ...k ... See full document

7

Processing k nearest neighbor queries in location-aware sensor networks

Processing k nearest neighbor queries in location-aware sensor networks

... IKNN algorithm Inspired by IWQE, we adopt itinerary-based approach for KNN query ...KNN search region estimated by KBT algorithm, and process KNN query by traversing the ...KNN search ... See full document

21

K Nearest Neighbor Queries and KNN-Joins in Large Relational Databases (Almost) for Free

K Nearest Neighbor Queries and KNN-Joins in Large Relational Databases (Almost) for Free

... Medrank algorithm: average and the %5-%95 confidence ...much for the uniform data, when using multiple shifts. On the other hand, for a highly skewed data set, such as California, increasing the α ... See full document

12

Hadamard transform based fast codeword search algorithm for high-dimensional VQ encoding

Hadamard transform based fast codeword search algorithm for high-dimensional VQ encoding

... codeword search is initialized with the codeword whose Hadamard-transformed first element is nearest to that of the input vector; and finally the closest codeword is found by an up-and-down search ... See full document

6

Secure Nearest Neighbor Revisited

Secure Nearest Neighbor Revisited

... basis for their SNN method ...hard for the adversary to derive the correct linear equations to use, since the formulation of the equations depends on ... See full document

12

Regularized Double Nearest Neighbor Feature Extraction for Hyperspectral I mage Classification

Regularized Double Nearest Neighbor Feature Extraction for Hyperspectral I mage Classification

...  Use proportion mean in each group, so the be tween groups scatter could be measured mor e properly, the entries of the Sb will not be so close zero, the influence of the outliers will[r] ... See full document

53

A grey-based nearest neighbor approach for predicting missing attribute values

A grey-based nearest neighbor approach for predicting missing attribute values

... suitable for domains with numeric ...above nearest neighbors are found through grey relational analysis, which is appropriate for both symbolic and numeric attributes and provides whole relational ... See full document

7

Fast All Nearest Neighbor Algorithms from Image Processing Perspective

Fast All Nearest Neighbor Algorithms from Image Processing Perspective

... algorithms for solving the 2D EDT, 2D ANN and 3D ANN problems from image processing perspective on the LARPBS model by fully taking the advantages of the LARPBS properties such as unidirectional propagation and ... See full document

10

An Adaptive Nearest Neighbor Classifier Based on Nonparametric Separability

An Adaptive Nearest Neighbor Classifier Based on Nonparametric Separability

... metric for computing a new neighborhood. For each test pattern, the modified neighborhood shrinks in the direction with high separability around this pattern and extends further in the other ... See full document

12

PDA Filter Based on the Winner-Update Strategy for Visual Tracking

PDA Filter Based on the Winner-Update Strategy for Visual Tracking

... While the target information is provided by a visible- light camera, much more information is available, like the shape, color, and size. We propose a method which incorporates this additional information into the PDA ... See full document

5

A fall detection system using k-nearest neighbor classifier

A fall detection system using k-nearest neighbor classifier

... 5. Conclusion The main purpose of this paper is to use off-the-shelf devices to develop a fall detection system. In practice, video surveillance sys- tem may infringe privacy to those who use the system, so human body ... See full document

8

AN IMPROVEMENT TO THE NEAREST NEIGHBOR CLASSIFIER AND FACE RECOGNITION EXPERIMENTS

AN IMPROVEMENT TO THE NEAREST NEIGHBOR CLASSIFIER AND FACE RECOGNITION EXPERIMENTS

... HIT Campus of Shenzhen University Town, Xili, Shenzhen 518055, P. R. China [email protected]; [email protected]; [email protected]; [email protected] Received November 2011; revised March 2012 Abstract. The ... See full document

6

Efficient Processing of k Nearest Neighbor Joins using MapReduce

Efficient Processing of k Nearest Neighbor Joins using MapReduce

... k nearest neighbor join (kNN join), designed to find k nearest neighbors from a dataset S for every object in another dataset R, is a primitive operation widely adopted by many data mining ap- ... See full document

12

Show all 10000 documents...