Filters








3,444 Hits in 5.8 sec

Self-avoiding walks over adaptive unstructured grids

Gerd Heber, Rupak Biswas, Guang R. Gao
2000 Concurrency Practice and Experience  
In this paper, we present self-avoiding walks as a novel technique to linearize" a triangular mesh.  ...  The proposed approach should be very useful in the runtime partitioning and load balancing of adaptive unstructured grids.  ...  ConclusionsIn this paper, we h a ve developed a theoretical basis for the study of self-avoiding walks over two-dimensional adaptive unstructured grids. We described an algo-  ... 
doi:10.1002/(sici)1096-9128(200002/03)12:2/3<85::aid-cpe471>3.0.co;2-8 fatcat:4w3s4bstnbaovheesdwcbsf3jy

Self-Avoiding walks over adaptive unstructured grids [chapter]

Gerd Heber, Rupak Biswas, Guang R. Gao
1999 Lecture Notes in Computer Science  
In this paper, we present self-avoiding walks as a novel technique to linearize" a triangular mesh.  ...  The proposed approach should be very useful in the runtime partitioning and load balancing of adaptive unstructured grids.  ...  of self-avoiding walks over two-dimensional adaptive unstructured grids.  ... 
doi:10.1007/bfb0097981 fatcat:2a6ma2bjrzailjm46kpav2nfpu

Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems [chapter]

Leonid Oliker, Xiaoye Li, Gerd Heber, Rupak Biswas
2000 Lecture Notes in Computer Science  
Self-Avoiding Walks (SAW) These were proposed recently [3] as a mesh-based (as opposed to geometry-based) technique with similar application areas as space-filling curves.  ...  Gao, "Self-Avoiding Runtimes (in seconds) for different orderings running in SHMEM and CC-NUMA modes on the SGI Origin2000.  ... 
doi:10.1007/3-540-45591-4_66 fatcat:uwd33zzsmfdfhgexzcmbxheoty

Counting Method for Multi-party Computation over Non-abelian Groups [chapter]

Youming Qiao, Christophe Tartary
2008 Lecture Notes in Computer Science  
This method is inspiring because, as far as we know, it is the first instance in which the theory of self-avoiding walk appears in multiparty computation.  ...  In the Crypto'07 paper [DPSW07] , Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups.  ...  A Self-Avoiding Walk (SAW) is a random walk such that the walker has a memory so that he will avoid any vertex which has been visited previously [MS96] .  ... 
doi:10.1007/978-3-540-89641-8_12 fatcat:onwhbxyhpvcyhe6fyhj6e3ueue

Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations

Leonid Oliker, Xiaoye Li, Parry Husbands, Rupak Biswas
2002 SIAM Review  
Figure 3.1 shows an example of a SAW over a 36-element triangular mesh. Fro. 3.1. An example of a self-avoiding walk (SAW) over a 36-element triangular mesh.  ...  To overcome this drawback, a novel approach, called a self-avoiding walk (SAW) [7], has recently been proposed.  ... 
doi:10.1137/s00361445003820 fatcat:o7uwxsbcfnf4ppcfc2sbpxncmm

Carpet unrolling for character control on uneven terrain

Mark Miller, Daniel Holden, Rami Al-Ashqar, Christophe Dubach, Kenny Mitchell, Taku Komura
2015 Proceedings of the 8th ACM SIGGRAPH Conference on Motion in Games - SA '15  
Given a terrain that a character is to walk over, the carpet is unrolled over the surface of the terrain.  ...  Figure 1 : (a)-(d) Snapshots of a quadruped character walking over an uneven terrain and (e) a snapshot of a large number of biped characters walking on uneven terrain in real-time.  ...  Characters need to walk over tilted terrains, stairs, and uneven rocky terrains, while avoiding obstacles, self-collisions and collisions with other characters.  ... 
doi:10.1145/2822013.2822031 dblp:conf/mig/MillerHADMK15 fatcat:glepnv63arbbnah3ivegub3sb4

A code for square permutations and convex permutominoes [article]

Enrica Duchi
2019 arXiv   pre-print
In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex  ...  While these two classes of objects arised independently in various contexts, they play a natural role in the description of certain random horizontally and vertically convex grid configurations.  ...  Convex permutominoes Like for square permutations, we use an approach in terms of points in the plane to introduce convexity in the context of self-avoiding polygons: • A closed self-avoiding walk on the  ... 
arXiv:1904.02691v3 fatcat:fdf5s7zngvhx7dtywxalw562zy

A code for square permutations and convex permutominoes

Enrica Duchi
2019 Discrete Mathematics & Theoretical Computer Science  
In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex  ...  While these two classes of objects arised independently in various contexts, they play a natural role in the description of certain random horizontally and vertically convex grid configurations.  ...  Convex permutominoes Like for square permutations, we use an approach in terms of points in the plane to introduce convexity in the context of self-avoiding polygons: • A closed self-avoiding walk on the  ... 
doi:10.23638/dmtcs-21-2-2 fatcat:tsgjkp3lbracjnixg2tlj6giee

Adaptive grids: an image-based approach to generate navigation meshes

Ateş Akaydın, Uğur Güdükbay
2013 Optical Engineering: The Journal of SPIE  
A navigation graph can then be extracted from this adaptive grid for path planning.  ...  We propose adaptive grids, an image-based approach for constructing navigation meshes, which are used for path planning.  ...  Adaptive grids also provides the following benefits over the traditional triangular meshes.  ... 
doi:10.1117/1.oe.52.2.027002 fatcat:z53jbs4czzfjpcyj7ysmnmdr2u

Page 9201 of Mathematical Reviews Vol. , Issue 2001M [page]

2001 Mathematical Reviews  
Gao, Self-avoiding walks over adaptive triangular grids (5 pp.); William F.  ...  Mitchell, A comparison of three fast repartition methods for adaptive grids (5 pp.); Bart Maerten, Dirk Roose, Achim Basermann, Jochen Fingberg and Guy Lonsdale, DRAMA: a library for parallel dynamic load  ... 

SoutheastCon 2019 Author Index

2019 2019 SoutheastCon  
Trajectory Tracking Control for an Underwater Vehicle Manipulator System Using a Neural-adaptive Network -102 Højgaard Jensen, Peter Talega SynCon -Power Grid Support for Renewable-based Systems -12 Idubore  ...  193 Telezhkin, Vladimir State Prediction in Compound Control Systems via Time Series: Neural Network Approach -137 Thanoon, Mohammed Development of Decision Fusion Model Using Grey Mixed Center Point Triangular  ... 
doi:10.1109/southeastcon42311.2019.9020629 fatcat:o76za6f7gzbtbhbsuzg6kogxne

Conformally invariant scaling limits (an overview and a collection of problems) [article]

Oded Schramm
2006 arXiv   pre-print
The SLE curves appear as limits of interfaces or paths occurring in a variety of statistical physics models as the mesh of the grid on which the model is defined tends to zero.  ...  Over the years, physicists proposed predictions of various exponents describing the behavior of these models. Only recently have some of these predictions become accessible to mathematical proof.  ...  Self avoiding walk. Let G be either the square, the hexagonal or the triangular grid in the plane, positioned so that 0 is some vertex in G.  ... 
arXiv:math/0602151v2 fatcat:glk7pdoqxbg7jcnrupbvlc5fjm

Decentralized Autonomous Navigation Strategies for Multi-Robot Search and Rescue [article]

Ahmad Baranzadeh
2016 arXiv   pre-print
We propose three novel algorithms that are using a triangular grid pattern, i.e., robots certainly go through the vertices of a triangular grid during the search procedure.  ...  The main advantage of using a triangular grid pattern is that it is asymptotically optimal in terms of the minimum number of robots required for the complete coverage of an arbitrary bounded area.  ...  Levy random- walk and Potential Field Random Trian- gular Grid- Based Semi- Random Trian- gular Grid- Based Modified Triangular- Grid- Based 1 1.1 2.3 2.3 3.0 6.4 13.0 5 3.0  ... 
arXiv:1605.04368v1 fatcat:7awp2wfanvhr5p6ymw3rnbyscm

Conformally invariant scaling limits: an overview and a collection of problems [chapter]

Oded Schramm
2011 Selected Works of Oded Schramm  
The SLE curves appear as limits of interfaces or paths occurring in a variety of statistical physics models as the mesh of the grid on which the model is defined tends to zero.  ...  Over the years, physicists proposed predictions of various exponents describing the behavior of these models. Only recently have some of these predictions become accessible to mathematical proof.  ...  Self avoiding walk. Let G be either the square, the hexagonal or the triangular grid in the plane, positioned so that 0 is some vertex in G.  ... 
doi:10.1007/978-1-4419-9675-6_34 fatcat:ifhanshecfgs5j2kgjkik3auoe

Person tracking in three-dimensional laser range data with explicit occlusion adaption

Florian Scholer, Jens Behley, Volker Steinhage, Dirk Schulz, Armin B. Cremers
2011 2011 IEEE International Conference on Robotics and Automation  
The laser range data is represented using a voxel grid, which facilitates efficient retrieval and data reduction.  ...  Introduced is a method to adapt the observation model of a particle filter, to identify partial and full occlusions of a person, to determine the amount of occlusion behind an obstacle, and the occluding  ...  Our results show that the height adaption has a great advantage over the non-adaptive model.  ... 
doi:10.1109/icra.2011.5979984 dblp:conf/icra/ScholerBSSC11 fatcat:h6bjxulqpvftxcp5iy6chjyavq
« Previous Showing results 1 — 15 out of 3,444 results