نتایج جستجو برای: edge preserved algorithm
تعداد نتایج: 891337 فیلتر نتایج به سال:
It is a consequence of the theorem of Stallings on groups with many ends that splittings over finite groups are preserved by quasi-isometries. In this paper we use asymptotic topology to show that group splittings are preserved by quasi-isometries in many cases. Roughly speaking we show that splittings are preserved under quasi-isometries when the vertex groups are fundamental groups of aspheri...
Echocardiographic images are inherent with speckle noise which makes visual reading and analysis quite difficult. The multiplicative speckle noise masks finer details, necessary for diagnosis of abnormalities. A novel speckle reduction technique based on integration of geometric, wiener, and fuzzy filters is proposed and analyzed in this paper. The denoising applications of fuzzy filters are st...
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
In this talk we investigate some classes of structures that are preserved by applying a QR step on a matrix A. We will handle two classes of such structures: the first we call polynomial structures, for example a matrix being Hermitian or Hermitian up to a rank one correction, and the second we call rank structures, which are encountered for example in all kinds of what we could call Hessenberg...
Large-volume mesh model faces challenge in rendering, storing, and transmission due to large size of polygon data. Mesh simplification is one of solutions to reduce the data size. This paper presents a mesh simplification method based on feature extraction with curvature estimation to triangle mesh. The simplified topology preserves good geometrical features in the area with distinct features, ...
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید