Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Fenglien Lee"'
Publikováno v:
CSE
In this paper, we developed an efficient algorithm for route discovery and management, and mobility handling for on-demand routing on mobile ad hoc networks (MANET). We applied L-1 and L-2 route caches in each node to manage this algorithm efficientl
Publikováno v:
CSE
There have been many studies on developing more accurate edge detection algorithms and employing them for various applications - especially in geographic information system images and maps, say coastline images. In this paper the coastline images are
Autor:
Fenglien Lee, Haklin Kimm
Publikováno v:
ICCSCE
In this paper, dynamic programming approach is applied to a pipelined optical bus system for finding the longest upsequence, maximum increasing sequence in a given set of values V = (v 1 , v 2 , … , v n ). The pipelined optical bus system that we a
Publikováno v:
ICUIMC
In mobile ad hoc networks, wireless nodes communicate each other, such as exchanging data or signals, over multiple hops in autonomous way. But the mobile nodes can only transmit data within the limited signal range that depends on transmission power
Autor:
Fenglien Lee
Publikováno v:
Mobile Ad-Hoc Networks: Protocol Design
A mobile ad hoc network (MANET), sometimes called a mobile mesh network, is a selfconfiguring network of mobile devices connected by wireless links. In other words, a MANET is a collection of communication nodes that wish to communicate with each oth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cfff6de63fc3c27522e9c863931b791
https://doi.org/10.5772/13155
https://doi.org/10.5772/13155
Publikováno v:
2009 2nd IEEE International Conference on Computer Science and Information Technology.
In this paper, we developed an efficient algorithm for route discovery and management, and mobility handling for on-demand cache routing on mobile ad hoc networks (MANET). We applied L-1 and L-2 route caches in each node to manage this algorithm effi
Autor:
Fenglien Lee
Publikováno v:
ACM Southeast Regional Conference
In this paper, we develop a parallel algorithm on the Intel Paragon supercomputer for constructing the two-dimensional Delaunay triangulation (called 2-d DT) of a point set with N points on the plane. The time complexity of the best sequential algori
Autor:
Fenglien Lee, Richard Jou
Publikováno v:
ACM Southeast Regional Conference
In this paper, we present some efficient parallel geometric algorithms for computing the All Nearest Neighbors, Delaunay Triangulation, Convex Hull, and Voronoi Diagram of a point set S with N points in the plane. The algorithm of All Nearest Neighbo
Publikováno v:
2009 2nd IEEE International Conference on Computer Science & Information Technology; 2009, p167-171, 5p