Sciweavers

421 search results - page 6 / 85
» A Reflective Symmetry Descriptor
Sort
View
DAC
2008
ACM
14 years 8 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
DAGSTUHL
2006
13 years 9 months ago
Coxeter Lattice Paths
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
Thomas J. Ashby, Anthony D. Kennedy, Stephen M. Wa...
TCS
2002
13 years 7 months ago
Tilings as a programming exercise
We investigate the problem of producing symmetric tilings by programs in a uniform way. By this, we mean that the construction of a tiling should be parameterized by the geometric...
Guy Cousineau
ICPR
2006
IEEE
14 years 8 months ago
Matching 2D Shapes using their Symmetry Sets
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the ...
Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter...
TIT
2008
115views more  TIT 2008»
13 years 7 months ago
Affine Reflection Group Codes
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
Terasan Niyomsataya, Ali Miri, Monica Nevins