Showing 1-25 of 1,226 resultsfor "Index Terms":Shortest Distance Calculation
"Index Terms":Shortest Distance Calculation
- Sort
Get notified when new research is published matching your search criteria.
Sort By
Results
Detour Path Angular Information based Range Free Localization with Last Hop RSSI Measurement based Distance Calculation
2019 Twelfth International Conference on Mobile Computing and Ubiquitous Network (ICMU)
Year: 2019 | Conference Paper |
Cited by: Papers (3)
The location estimation accuracy of range-free localization (RFL) is a crucial issue in Wireless Sensor Networks (WSNs). The accuracy has significant impact on localization dependent routing protocols and applications. The assumption that the sensor nodes are deployed in regular areas without any obstacles do not match the practical deployment scenarios, especially for scenarios like outdoor deplo...Show More
Skyline computation is relevant in multi-criteria decision making where the criteria are inversely proportional to each other. Skyline is generally computed using dominance analysis and applicable in a situation where shortest distance is computed with respect to a point of importance. In real life scenarios different cost parameters are obviously high for the points which are designated as "impor...Show More
Geodesic distance based aproach for sentence similarity computation
2008 International Conference on Machine Learning and Cybernetics
Year: 2008 | Conference Paper |
Cited by: Papers (1)
This paper presents a novel approach based on geodesic distance for sentence similarity computation, which can be used in a query-based information retrieval system. Unlike the traditional distance methods, geodesic distance takes into account the spatial relationships of sentences, which better reflects the intrinsic geometric structure of sentence manifold. Experiments demonstrate that the propo...Show More
Optimization research of short text semantic clustering based on the social media
2017 IEEE 3rd Information Technology and Mechatronics Engineering Conference (ITOEC)
Year: 2017 | Conference Paper |
Cited by: Papers (2)
Based on the existing research of Chinese text clustering, this paper proposes an improved algorithm for the optimization of short term semantic clustering based on social media. The method of weighted factor is introduced to optimize text distance formula and related mathematical proof, the calculation process optimization design from text, written text distance calculation algorithm, the simulat...Show More
Developed Dijkstra shortest path search algorithm and simulation
2010 International Conference On Computer Design and Applications
Year: 2010 | Conference Paper |
Cited by: Papers (16)
This paper presents an improved Dijkstra shortest path search algorithm. The algorithm considers the different types of weights, set the priority target search region, reduce the large number of meaningless operations, in order to improve search efficiency. We do some relevant testing based on the shortest distance and shortest time through simulation. The simulation show that the improved Dijkstr...Show More
Spherical Distance Transforms
2008 International Conference on Computational Sciences and Its Applications
Year: 2008 | Conference Paper |
Cited by: Papers (2)
We present three algorithms for computing correct distance fields on a unit sphere. These algorithms enhance conventional distance transform techniques with several extensions. The first algorithm is a wavefront scheme using quaternions. As a unit quaternion represents a single rotation corresponding to the distance on a sphere, correct distances can be evaluated. Second, we propose a Euclidean ve...Show More
Determine the Shortest Path Problem Using Haversine Algorithm, A Case Study of SMA Zoning in Depok
2021 3rd International Congress on Human-Computer Interaction, Optimization and Robotic Applications (HORA)
Year: 2021 | Conference Paper |
Cited by: Papers (5)
The new student admission evolves with government rules which are described in the ministerial decrees. Zoning is suite of policies that are intact, integrated, and systematic in attempt to do a restoration in educational field. The new student admission is applied with zoning system, based on Depok Mayor Regulation No. 20 of 2020, Technical Instructions for Admission of New Students, 2020 that ad...Show More
Optimization research based on the online comment clustering of short text
2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference
Year: 2016 | Conference Paper |
Cited by: Papers (1)
On the basis of the existing research of the online comment clustering of short text, an improved text distance optimization method based on the online comment clustering of short text is proposed. The the weight factor is introduced in order to optimize the formula and the golden section method is used to optimize the experimental results in the improved method. The results of simulation experime...Show More
Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
2008 International Conference on Computational Sciences and Its Applications
Year: 2008 | Conference Paper |
Cited by: Patents (2)
We present algorithms for computing approximate distance functions and shortest paths from a generalized source point, segment, polygonal chain or polygonal region) on a eighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also describe an algorithm for discretizing, by using graphics hardware capabilities, distance functions. Final...Show More
Parallel and Improvement of Pre-computation Technique for Approximation Shortest Distance Query
2015 Seventh International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)
Year: 2015 | Conference Paper |
With the development of mobile Internet, more and more applications are associated with location. There are many applications just care about shortest distance of two points and do not care about the paths, such as take-away applications. The problem of shortest distance query of objects has caught many researchers' attention in recent years. One of solutions is pre-computation. We can select repr...Show More
Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)
Year: 2007 | Conference Paper |
Cited by: Papers (3)
We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex polyhedral surface in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal cha...Show More
Clustering of scale free networks using a k-medoid framework
2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)
Year: 2011 | Conference Paper |
Cited by: Papers (2)
Clustering is a very important topic in the field of pattern recognition and artificial intelligence. Also it has become popular in newer application areas like communication networking, data mining, bio-informatics, web mining, mobile computing etc. This article describes a network clustering technique based on PAM or k-medoid algorithm with appropriate modification. This algorithm works faster t...Show More
A Parallel Shortest Path Algorithm Based on Graph-Partitioning and Iterative Correcting
2008 10th IEEE International Conference on High Performance Computing and Communications
Year: 2008 | Conference Paper |
Cited by: Papers (10)
In this paper, we focus on satisfying the actual demands of quickly finding the shortest paths over real-road networks in an intelligent transportation system. A parallel shortest path algorithm based on graph partitioning and iterative correcting is proposed. After evaluating the algorithm using three real road networks, we conclude that our graph-partitioning and iterative correcting based paral...Show More
Supervised t-SNE for Metric Learning With Stochastic and Geodesic Distances
Alaor Cervati Neto;Alexandre L. M. Levada;Michel Ferreira Cardia Haddad
The t-distributed stochastic neighbor embedding (t-SNE) consists of a powerful algorithm for visualizing high-dimensional data in a lower dimensional space. It is extensively employed in machine learning (ML) and data analysis, including unsupervised metric learning. In this article, we propose improvements concerning two main aspects of the t-SNE. First, the incorporation of class labels is adopt...Show More
Automatic Dysarthric Speech Detection Exploiting Pairwise Distance-Based Convolutional Neural Networks
ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Year: 2021 | Conference Paper |
Cited by: Papers (12)
Automatic dysarthric speech detection can provide reliable and cost-effective computer-aided tools to assist the clinical diagnosis and management of dysarthria. In this paper we propose a novel automatic dysarthric speech detection approach based on analyses of pairwise distance matrices using convolutional neural networks (CNNs). We represent utterances through articulatory posteriors and consid...Show More
A fast estimation of shortest path distance for power-law network predominant cloud service
4th IEEE International Conference on Cloud Computing Technology and Science Proceedings
Year: 2012 | Conference Paper |
The estimation of the shortest path between two vertices in a network graphs is an important issue for many applications in the real world, which may be road networks, social collaboration networks, biological networks and so forth. The short response time, the less space cost and the high accuracy are three critical evaluation metrics in the approximate calculation of the shortest path. To achiev...Show More
Link Distance and Carrier Frequency Dependence of Propagation Attenuation in OAM Multiplexing Using Parabolic Antenna
2023 IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)
Year: 2023 | Conference Paper |
Cited by: Papers (2)
The adoption of a parabolic antenna is effective in further improving the transmission performance of orbital angular momentum (OAM) multiplexing. Although it has been demonstrated that the propagation attenuation for OAM multiplexing using a parabolic antenna does not necessarily depend on the OAM mode for a relatively short link distance, the influence of the link distance on propagation attenua...Show More
Link Distance and Carrier Frequency Dependence of Propagation Attenuation in OAM Multiplexing Using Parabolic Antenna
Year: 2023 | Conference Paper |
A linear time pre-processing for optimization of shortest path and distance algorithms
2017 IEEE International Conference on Signal Processing, Informatics, Communication and Energy Systems (SPICES)
Year: 2017 | Conference Paper |
Finding shortest distances and paths have always been a crucial area of study. In this article, we have proposed a linear time pre-processing method for optimization of shortest path and distance algorithms, for an undirected weighted graph with non-negative edges. In this approach, certain parts of a graph are grouped together as subgraphs termed as optimized deterministic routing areas (ODRAs). ...Show More
A rapid fuzzy distance transform algorithm
2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)
Year: 2017 | Conference Paper |
The FDT (Fuzzy Distance Transformation) based method was found to be remarkably robust to derive trabecular bone thickness in a low-resolution regime. Unfortunately, the traditional dynamic programming based FDT method is not efficient enough to satisfy many applications. To improve the efficiency, the redundant operations of traditional FDT method are analyzed. Subsequently, the dijkstra algorith...Show More
Cutting Force Similarity Calculation in Milling Process Using Siamese LSTM Structure
Juheon Kwak;Wonkeun Jo;Soomin Lee;Hyein Kim;Jeongin Koo;Dongil Kim
2023 2nd International Conference on Mechatronics and Electrical Engineering (MEEE)
Year: 2023 | Conference Paper |
Cutting force is a key factor in machining processes. Cutting force similarity is required for several important issues, namely: stability evaluation, process control, and process parameter setting. This study employed a long short-term memory (LSTM) with Siamese architecture to measure the similarity of the cutting forces in a milling process. The Siamese LSTM was trained with time series data of...Show More
An Efficient Technique for Distance Computation in Road Networks
Fifth International Conference on Information Technology: New Generations (itng 2008)
Year: 2008 | Conference Paper |
With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road networks such as nearest neighbor querying and the analysis of moving objects trajectories come into sight which present challenges to the database community. The essential part of the queries behind these services is related...Show More
A*-FastIsomap: An Improved Performance of Classical Isomap Based on A* Search Algorithm
2022 5th International Conference on Artificial Intelligence and Big Data (ICAIBD)
Year: 2022 | Conference Paper |
Nonlinear Dimensionality Reduction (NLDR) is a well-known approach of manifold learning to transform the data from high to low dimensional space. After studying various techniques proposed for the NLDR, we find that performance improvement is still required. Therefore, we adopt classical Isomap, which faces Shortest Path Distance (SPD) and high computational time cost problems. These problems are ...Show More
Graph Calculus: Scalable Shortest Path Analytics for Large Social Graphs through Core Net
2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)
Year: 2013 | Conference Paper |
Cited by: Papers (1)
We focus on the problem of scalable shortest path analytics for large social graphs in this paper. While shortest path distance problem has been investigated extensively, massive graphs on social networks such as Facebook and Linked In call for reinvestigation of the problem due to the requirements of scalability and suitability for distributed computing. We propose a core-net based approach to ad...Show More
A combined distance measure for 2D shape matching
International Conference on Computer Vision and Image Analysis Applications
Year: 2015 | Conference Paper |
Cited by: Papers (2)
We present a method for 2D shape matching using a combination of distance functions and discrete curvature. The eccentricity transform computes the longest geodesic distance across the object. This transform is invariant to translation and rotation. The maximal eccentricity points yield diameters across the image. We compute the Euclidean distances from the boundary to the diameter to characterize...Show More
Short-term stock price forecasting based on similar historical patterns extraction
2017 23rd International Conference on Automation and Computing (ICAC)
Year: 2017 | Conference Paper |
Cited by: Papers (1)
In this paper, a new similar stock prices patterns extraction method is proposed for short-term stock trend forecasting. Different from Euclidean distance and conventional dynamic time warping (DTW) based historical features extraction, the new feature extraction method is developed based on a modified DTW approach, which allows the length of historical sub-sequences to be in a suitable range and ...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.