Cart (Loading....) | Create Account
Close category search window

A Skipping SvS Intersection Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chatchaval, J. ; Math. & Comput. Sci. Dept., King Mongkut''s Inst. of Technol. Ladkrabang, Ladkrabang, Thailand ; Boonjing, V. ; Chanvarasuth, P.

In this paper, we propose to improve the SvS algorithm by skipping elements of the smaller set for reducing a search boundary. The boundary of skipped element is determined by boundaries of elements prior to and next to it. We perform experiments on uniformly distributed random datasets to compare our algorithm with the standard SvS. We use regression analysis to get an equation for determining an appropriate skipping number. Our results show that the skipping SvS algorithm using the equation obtained can reduce approximately 41% on the number of comparisons of the standard SvS algorithm.

Published in:

Computing, Engineering and Information, 2009. ICC '09. International Conference on

Date of Conference:

2-4 April 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.