No abstract available.
Cited By
- Kallrath J and Frey M (2019). Packing circles into perimeter-minimizing convex hulls, Journal of Global Optimization, 73:4, (723-759), Online publication date: 1-Apr-2019.
- Pronzato L and Zhigljavsky A (2019). Measures Minimizing Regularized Dispersion, Journal of Scientific Computing, 78:3, (1550-1570), Online publication date: 1-Mar-2019.
- Gurjar R and Vishnoi N On the number of circuits in regular matroids (with connections to lattices and codes) Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (861-880)
- Busto D, Evans W and Kirkpatrick D Minimizing interference potential among moving entities Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (2400-2418)
- Qiu M, Huang Y and Yuan J (2019). Downlink Non-Orthogonal Multiple Access Without SIC for Block Fading Channels: An Algebraic Rotation Approach, IEEE Transactions on Wireless Communications, 18:8, (3903-3918), Online publication date: 1-Aug-2019.
- Chen M, Jiang H, Liao W and Zhao T Efficient approximation of deep ReLU networks for functions on low dimensional manifolds Proceedings of the 33rd International Conference on Neural Information Processing Systems, (8174-8184)
- Zhang Y, Yu H and Zhang J (2019). Constellation-Optimal Beamformers for Multiuser MISO Broadcast Visible Light Communications, IEEE Transactions on Information Theory, 65:6, (3848-3870), Online publication date: 1-Jun-2019.
- Wang Z and Ling C (2019). Lattice Gaussian Sampling by Markov Chain Monte Carlo, IEEE Transactions on Information Theory, 65:6, (3630-3645), Online publication date: 1-Jun-2019.
- Huang Y (2017). Lattice Index Codes From Algebraic Number Fields, IEEE Transactions on Information Theory, 63:4, (2098-2112), Online publication date: 1-Apr-2017.
- Chang S (2017). Frontiers of Multimedia Research, 10.1145/3122865, Online publication date: 19-Dec-2017.
- Regev O and Stephens-Davidowitz N A reverse Minkowski theorem Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, (941-953)
- Zhang K (2017). Spherical Cap Packing Asymptotics and Rank-Extreme Detection, IEEE Transactions on Information Theory, 63:7, (4572-4584), Online publication date: 1-Jul-2017.
- Shishkin S and Finn A (2016). An optimal algorithm for Global Optimization and adaptive covering, Journal of Global Optimization, 66:3, (535-572), Online publication date: 1-Nov-2016.
- Yoo Y, Ozan Koyluoglu O, Vishwanath S and Fiete I (2016). Multi-periodic neural coding for adaptive information transfer, Theoretical Computer Science, 633:C, (37-53), Online publication date: 20-Jun-2016.
- Petkov K and Kaufman A (2016). Frameless Volume Visualization, IEEE Transactions on Visualization and Computer Graphics, 22:2, (1076-1087), Online publication date: 1-Feb-2016.
- Tagliasacchi M, Visentini-Scarzanella M, Dragotti P and Tubaro S (2016). Identification of Transform Coding Chains, IEEE Transactions on Image Processing, 25:3, (1109-1123), Online publication date: 1-Mar-2016.
- Hara K, Suzuki I, Kobayashi K, Fukumizu K and Radovanović M Flattening the density gradient for eliminating spatial centrality to reduce hubness Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, (1659-1665)
- Józsa C, Kolumbán G, Vidal A, Martínez-Zaldívar F and González A (2015). Parallel sphere detector algorithm providing optimal MIMO detection on massively parallel architectures, Concurrency and Computation: Practice & Experience, 27:17, (4993-5018), Online publication date: 10-Dec-2015.
- Xu K, Zhu L, Zhang D, Xu Y, Ma W and Xie W (2014). Synchronization approach for dynamic hexagonal time-frequency lattice MCM system, Digital Signal Processing, 25:C, (72-83), Online publication date: 1-Feb-2014.
- Vad V, Csébfalvi B, Rautek P and Gröller E Towards an unbiased comparison of CC, BCC, and FCC lattices in terms of prealiasing Proceedings of the 16th Eurographics Conference on Visualization, (81-90)
- Meyer A (2013). On the number of lattice points in a small sphere and a recursive lattice decoding algorithm, Designs, Codes and Cryptography, 66:1-3, (375-390), Online publication date: 1-Jan-2013.
- Furon T and Bas P A new measure of watermarking security applied on QIM Proceedings of the 14th international conference on Information Hiding, (207-223)
- Esen E and Alatan A (2012). Comparison of Forbidden Zone Data Hiding and Quantization Index Modulation, Digital Signal Processing, 22:1, (181-189), Online publication date: 1-Jan-2012.
- Bernardini R, Fabbro R and Rinaldo R (2011). Group-based reduction schemes for streaming applications, ISRN Communications and Networking, 2011, (1-10), Online publication date: 1-Jan-2011.
- Edelsbrunner H and Kerber M Covering and packing with spheres by diagonal distortion in Rn Rainbow of computer science, (20-35)
- Neylon T A locality-sensitive hash for real vectors Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (1179-1189)
- Paulevé L, Jégou H and Amsaleg L (2010). Locality sensitive hashing, Pattern Recognition Letters, 31:11, (1348-1358), Online publication date: 1-Aug-2010.
- Fiore P (2010). Scale-recursive lattice-based multiple-access symbol constellations, IEEE Transactions on Information Theory, 56:1, (211-223), Online publication date: 1-Jan-2010.
- Blackburn S, Etzion T, Martin K and Paterson M (2010). Two-dimensional patterns with distinct differences, IEEE Transactions on Information Theory, 56:3, (1216-1229), Online publication date: 1-Mar-2010.
- Blackburn S, Etzion T, Martin K and Paterson M (2010). Distinct difference configurations, IEEE Transactions on Information Theory, 56:8, (3961-3972), Online publication date: 1-Aug-2010.
- Babadi B and Tarokh V (2010). GADIA, IEEE Transactions on Information Theory, 56:12, (6228-6252), Online publication date: 1-Dec-2010.
- Plantard T and Susilo W Recursive lattice reduction Proceedings of the 7th international conference on Security and cryptography for networks, (329-344)
- Harada M and Munemasa A (2009). There exists no self-dual [24,12,10] code over $${{\mathbb F}_5}$$, Designs, Codes and Cryptography, 52:1, (125-127), Online publication date: 1-Jul-2009.
- Lazos L, Poovendran R and Ritcey J (2009). Analytic evaluation of target detection in heterogeneous wireless sensor networks, ACM Transactions on Sensor Networks, 5:2, (1-38), Online publication date: 1-Mar-2009.
- Nguyen P and Stehlé D (2009). Low-dimensional lattice basis reduction revisited, ACM Transactions on Algorithms, 5:4, (1-48), Online publication date: 1-Oct-2009.
- Xu K and Shen Y (2009). Effects of carrier frequency offset, timing offset, and channel spread factor on the performance of hexagonal multicarrier modulation systems, EURASIP Journal on Wireless Communications and Networking, 2009, (1-8), Online publication date: 1-Jan-2009.
- Vu M and Tarokh V (2009). Scaling laws of single-hop cognitive networks, IEEE Transactions on Wireless Communications, 8:8, (4089-4097), Online publication date: 1-Aug-2009.
- El-Hajjar M, Alamri O and Hanzo L Iteratively detected three-stage multi-dimensional sphere packing modulation aided multi-functional MIMO Proceedings of the 28th IEEE conference on Global telecommunications, (6125-6129)
- Tirkkonen O, Hugl K and Teng Y Two-tx precoding codebooks for variable spatial correlation Proceedings of the 2009 IEEE international conference on Communications, (3566-3571)
- Shoa A and Shirani S (2009). Design and analysis of a successively refinable lattice quantizer for i.i.d. Gaussian sources, IEEE Transactions on Signal Processing, 57:3, (1222-1227), Online publication date: 1-Mar-2009.
- Yang Y, Cheng S, Xiong Z and Zhao W (2009). Wyner-Ziv coding based on TCQ and LDPC codes, IEEE Transactions on Communications, 57:2, (376-387), Online publication date: 1-Feb-2009.
- Sun Y, Yang Y, Liveris A, Stankovic V and Xiong Z (2009). Near-capacity dirty-paper code design, IEEE Transactions on Information Theory, 55:7, (3013-3031), Online publication date: 1-Jul-2009.
- Liao H, Wang H and Xia X (2009). Some designs and normalized diversity product upper bounds for lattice-based diagonal and full-rate space-time block codes, IEEE Transactions on Information Theory, 55:2, (569-583), Online publication date: 1-Feb-2009.
- Ryde J and Brünig M Non-cubic occupied voxel lists for robot maps Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (4771-4776)
- Boumova S, Boyvalenkov P, Kulina H and Stoyanova M (2009). Polynomial techniques for investigation of spherical designs, Designs, Codes and Cryptography, 51:3, (275-288), Online publication date: 1-Jun-2009.
- Konstantinova E (2009). Vertex reconstruction in Cayley graphs, Discrete Mathematics, 309:3, (548-559), Online publication date: 1-Feb-2009.
- Alamri O, Wang J, Ng S, Yang L and Hanzo L (2009). Near-capacity three-stage turbo detection of irregular convolutional coded joint sphere-packing modulation and space-time coding, IEEE Transactions on Communications, 57:5, (1486-1495), Online publication date: 1-May-2009.
- El-Hajjar M, Alamri O, Wang J, Zummo S and Hanzo L (2009). Layered steered space-time codes using multi-dimensional sphere packing modulation, IEEE Transactions on Wireless Communications, 8:7, (3335-3340), Online publication date: 1-Jul-2009.
- Grover P, Sahai A and Park S The finite-dimensional Witsenhausen counterexample Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, (604-613)
- Razavi S and Giurcaneanu C (2009). Optimally distinguishable distributions, IEEE Transactions on Signal Processing, 57:7, (2445-2455), Online publication date: 1-Jul-2009.
- Akhaee M, Saberian M, Feizi S and Marvasti F (2009). Robust audio data hiding using correlated quantization with histogram-based detector, IEEE Transactions on Multimedia, 11:5, (834-842), Online publication date: 1-Aug-2009.
- Abdukhalikov K, Bannai E and Suda S (2009). Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets, Journal of Combinatorial Theory Series A, 116:2, (434-448), Online publication date: 1-Feb-2009.
- Harada M and Munemasa A (2009). A complete classification of ternary self-dual codes of length 24, Journal of Combinatorial Theory Series A, 116:5, (1063-1072), Online publication date: 1-Jul-2009.
- Hormis R and Wang X (2009). Low-complexity coded-modulation for ISI-constrained channels, IEEE Transactions on Communications, 57:6, (1836-1846), Online publication date: 1-Jun-2009.
- Kumar K and Caire G (2009). Space-time codes from structured lattices, IEEE Transactions on Information Theory, 55:2, (547-556), Online publication date: 1-Feb-2009.
- Wang H, Wang D and Xia X (2009). On optimal quasi-orthogonal space-time block codes with minimum decoding complexity, IEEE Transactions on Information Theory, 55:3, (1104-1130), Online publication date: 1-Mar-2009.
- Su W, Safar Z and Liu K (2009). Orthogonal space-time block codes with sphere packing, IEEE Transactions on Information Theory, 55:4, (1627-1639), Online publication date: 1-Apr-2009.
- Kumar K and Caire G (2009). Coding and decoding for the dynamic decode and forward relay protocol, IEEE Transactions on Information Theory, 55:7, (3186-3205), Online publication date: 1-Jul-2009.
- Østergaard J and Zamir R (2009). Multiple-description coding by dithered delta-sigma quantization, IEEE Transactions on Information Theory, 55:10, (4661-4675), Online publication date: 1-Oct-2009.
- Kochman Y and Zamir R (2009). Joint Wyner-Ziv/dirty-paper coding by modulo-lattice modulation, IEEE Transactions on Information Theory, 55:11, (4878-4889), Online publication date: 1-Nov-2009.
- Krithivasan D and Pradhan S (2009). Lattices for distributed source coding, IEEE Transactions on Information Theory, 55:12, (5628-5651), Online publication date: 1-Dec-2009.
- Liu M and Zhu C (2009). M-description lattice vector quantization, IEEE Transactions on Signal Processing, 57:6, (2258-2274), Online publication date: 1-Jun-2009.
- McKilliam R and Clarkson I (2009). Identifiability and aliasing in polynomial-phase signals, IEEE Transactions on Signal Processing, 57:11, (4554-4557), Online publication date: 1-Nov-2009.
- Beko M, Xavier J and Barroso V Codebook design for communication in spread and nonspread space-time block codes-based systems Proceedings of the 6th international conference on Symposium on Wireless Communication Systems, (91-95)
- Zheng J, Bai B, Li Y, Gu D and Luo Y Study on modulo-lattice in vector perturbation for MIMO broadcast channels Proceedings of the 15th Asia-Pacific conference on Communications, (265-268)
- Koike-Akino T and Tarokh V Sphere packing optimization and EXIT chart analysis for multi-dimensional QAM signaling Proceedings of the 2009 IEEE international conference on Communications, (3888-3892)
- Siqueira R and Costa S (2008). Flat tori, lattices and bounds for commutative group codes, Designs, Codes and Cryptography, 49:1-3, (307-321), Online publication date: 1-Dec-2008.
- Gama N and Nguyen P Finding short lattice vectors within mordell's inequality Proceedings of the fortieth annual ACM symposium on Theory of computing, (207-216)
- Cerato B, Masera G and Viterbo E (2008). Enabling VLSI processing blocks for MIMO-OFDM Communications, VLSI Design, 2008:2, (1-10), Online publication date: 15-Jan-2008.
- van Dam E (2008). Two-dimensional minimax Latin hypercube designs, Discrete Applied Mathematics, 156:18, (3483-3493), Online publication date: 1-Nov-2008.
- Chinen K (2008). An abundance of invariant polynomials satisfying the Riemann hypothesis, Discrete Mathematics, 308:24, (6426-6440), Online publication date: 1-Dec-2008.
- Voight J Enumeration of totally real number fields of bounded root discriminant Proceedings of the 8th international conference on Algorithmic number theory, (268-281)
- Leibak A An explicit construction of initial perfect quadratic forms over some families of totally real number fields Proceedings of the 8th international conference on Algorithmic number theory, (240-252)
- Plantard T, Susilo W and Win K A digital signature scheme based on CV P∞ Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography, (288-307)
- Peikert C and Rosen A Lattices that admit logarithmic worst-case to average-case connection factors Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (478-487)
- Salleh M and Soraghan J (2007). A new multistage lattice vector quantization with adaptive subband thresholding for image compression, EURASIP Journal on Advances in Signal Processing, 2007:1, (78-78), Online publication date: 1-Jan-2007.
- Qiu F, Xu F, Fan Z, Neophytos N, Kaufman A and Mueller K (2007). Lattice-Based Volumetric Global Illumination, IEEE Transactions on Visualization and Computer Graphics, 13:6, (1576-1583), Online publication date: 1-Nov-2007.
- Bouguila N and Ziou D (2007). High-Dimensional Unsupervised Selection and Estimation of a Finite Generalized Dirichlet Mixture Model Based on Minimum Message Length, IEEE Transactions on Pattern Analysis and Machine Intelligence, 29:10, (1716-1731), Online publication date: 1-Oct-2007.
- Kucherenko S, Belotti P, Liberti L and Maculan N (2007). New formulations for the Kissing Number Problem, Discrete Applied Mathematics, 155:14, (1837-1841), Online publication date: 1-Sep-2007.
- Strand R and Nagy B (2007). Distances based on neighbourhood sequences in non-standard three-dimensional grids, Discrete Applied Mathematics, 155:4, (548-557), Online publication date: 20-Feb-2007.
- Santos F, Schürmann A and Vallentin F (2007). Lattice Delone simplices with super-exponential volume, European Journal of Combinatorics, 28:3, (801-806), Online publication date: 1-Apr-2007.
- Fouard C, Strand R and Borgefors G (2007). Weighted distance transforms generalized to modules and their computation on point lattices, Pattern Recognition, 40:9, (2453-2474), Online publication date: 1-Sep-2007.
- Howgrave-Graham N A hybrid lattice-reduction and meet-in-the-middle attack against NTRU Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (150-169)
- Xu F and Mueller K Applications of optimal sampling lattices for volume acquisition via 3D computed tomography Proceedings of the Sixth Eurographics / Ieee VGTC conference on Volume Graphics, (57-64)
- Imani N, Sarbazi-Azad H and Akl S Resource placement in networks using chromatic sets of power graphs Proceedings of the Second international conference on Computer Science: theory and applications, (158-167)
- Dougherty S, Gulliver T and Oura M (2006). Higher Weights for Ternary and Quaternary Self-Dual Codes*, Designs, Codes and Cryptography, 38:1, (97-112), Online publication date: 1-Jan-2006.
- Pérez-Freire L, Pérez-González F and Furon T On achievable security levels for lattice data hiding in the known message attack scenario Proceedings of the 8th workshop on Multimedia and security, (68-79)
- Bernardini R and Rinaldo R A simple distributed coding algorithm for sensor networks Proceedings of the 2nd international conference on Mobile multimedia communications, (1-6)
- Gama N, Howgrave-Graham N and Nguyen P Symplectic lattice reduction and NTRU Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques, (233-253)
- Gama N, Howgrave-Graham N, Koy H and Nguyen P Rankin's constant and blockwise lattice reduction Proceedings of the 26th annual international conference on Advances in Cryptology, (112-130)
- DeVinney J and Priebe C (2006). A new family of proximity graphs, Discrete Applied Mathematics, 154:14, (1975-1982), Online publication date: 1-Sep-2006.
- Heninger N, Rains E and Sloane N (2006). On the integrality of nth roots of generating functions, Journal of Combinatorial Theory Series A, 113:8, (1732-1745), Online publication date: 1-Nov-2006.
- Justice D and Hero A (2006). A Binary Linear Programming Formulation of the Graph Edit Distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, 28:8, (1200-1214), Online publication date: 1-Aug-2006.
- Dumer I (2006). Covering an ellipsoid with equal balls, Journal of Combinatorial Theory Series A, 113:8, (1667-1676), Online publication date: 1-Nov-2006.
- Sweatman C and Thompson J (2006). Orthotope sphere decoding and parallelotope decoding, Signal Processing, 86:7, (1518-1537), Online publication date: 1-Jul-2006.
- Franti P, Virmajoki O and Hautamaki V (2006). Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph, IEEE Transactions on Pattern Analysis and Machine Intelligence, 28:11, (1875-1881), Online publication date: 1-Nov-2006.
- da Fonseca J Code design as an optimization problem Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, (47-52)
- Dumer I, Pinsker M and Prelov V On the thinnest coverings of spheres and ellipsoids with balls in hamming and euclidean spaces General Theory of Information Transfer and Combinatorics, (898-925)
- Gannon T (2005). Modular Data, Journal of Algebraic Combinatorics: An International Journal, 22:2, (211-250), Online publication date: 1-Sep-2005.
- Raji M (2005). Higher Power Residue Codes and the Leech Lattice, Journal of Algebraic Combinatorics: An International Journal, 21:1, (39-53), Online publication date: 1-Jan-2005.
- Hamitouche C, Ibáñez L and Roux C (2005). Discrete Topology of (An*) Optimal Sampling Grids. Interest in Image Processing and Visualization, Journal of Mathematical Imaging and Vision, 23:3, (401-417), Online publication date: 1-Nov-2005.
- Bando Y, Saito T and Fujita M Hexagonal storage scheme for interleaved frame buffers and textures Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware, (33-40)
- Mao Y and Wu M Coordinated sensor deployment for improving secure communications and sensing coverage Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks, (117-128)
- Krüger J, Schneider J and Westermann R DUODECIM Proceedings of the Second Eurographics / IEEE VGTC conference on Point-Based Graphics, (99-107)
- Sanli H and Cam H Energy Efficient Differentiable Coverage Service Protocols for Wireless Sensor Networks Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops, (406-410)
- L'Ecuyer P and Touzin R (2004). On the Deng-Lin random number generators and related methods, Statistics and Computing, 14:1, (5-9), Online publication date: 1-Jan-2004.
- Ganesan G and Stoica P (2004). Constructing Space-Time Trellis Codes Using Orthogonal Designs, Wireless Personal Communications: An International Journal, 28:1, (1-15), Online publication date: 1-Jan-2004.
- Abrardo A and Barni M Fixed-Distortion orthogonal dirty paper coding for perceptual still image watermarking Proceedings of the 6th international conference on Information Hiding, (52-66)
- Entezari A, Dyer R and Moller T Linear and Cubic Box Splines for the Body Centered Cubic Lattice Proceedings of the conference on Visualization '04, (11-18)
- Lee A, Pedersen K and Mumford D (2003). The Nonlinear Statistics of High-Contrast Patches in Natural Images, International Journal of Computer Vision, 54:1-3, (83-103), Online publication date: 1-Aug-2003.
- Singh A, Ferhatosmanoglu H and Tosun A High dimensional reverse nearest neighbor queries Proceedings of the twelfth international conference on Information and knowledge management, (91-98)
- Reilly E and Kimberling C Mathematics, computers in Encyclopedia of Computer Science, (1096-1103)
- Grabmeier J, Kaltofen E and Weispfenning V Cited References Computer algebra handbook, (493-622)
- Danev D (2003). Some constructions of superimposed codes in Euclidean spaces, Discrete Applied Mathematics, 128:1, (85-101), Online publication date: 15-May-2003.
- Shankar P, Dasgupta A, Deshmukh K and Rajan B (2003). On viewing block codes as finite automata, Theoretical Computer Science, 290:3, (1775-1797), Online publication date: 3-Jan-2003.
- Cooper S (2003). Cubic theta functions, Journal of Computational and Applied Mathematics, 160:1-2, (77-94), Online publication date: 1-Nov-2003.
- Xu Y (2003). Lower bound for the number of nodes of cubature formulae on the unit ball, Journal of Complexity, 19:3, (392-402), Online publication date: 1-Jun-2003.
- Damelin S and Grabner P (2003). Energy functionals, numerical integration and asymptotic equidistribution on the sphere, Journal of Complexity, 19:3, (231-246), Online publication date: 1-Jun-2003.
- Margot F (2003). Exploiting orbits in symmetric ILP, Mathematical Programming: Series A and B, 98:1-3, (3-21), Online publication date: 1-Sep-2003.
- Georgiou S, Harada M and Koukouvinos C (2002). Orthogonal Designs and Type II Codes over \Bbb{Z}_{2k}, Designs, Codes and Cryptography, 25:2, (163-174), Online publication date: 2-Feb-2002.
- Sagastizábal C and Solodov M (2002). Parallel Variable Distribution for Constrained Optimization, Computational Optimization and Applications, 22:1, (111-131), Online publication date: 1-Apr-2002.
- Scaglione A and Servetto S On the interdependence of routing and data compression in multi-hop sensor networks Proceedings of the 8th annual international conference on Mobile computing and networking, (140-147)
- Huang H, Richa A and Segal M Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications, (52-61)
- Neophytou N and Mueller K Space-time points Proceedings of the 2002 IEEE symposium on Volume visualization and graphics, (97-106)
- Harada M, Kitazume M and Ozeki M (2002). Ternary Code Construction of Unimodular Lattices and Self-Dual Codes over \Bbb Z 6, Journal of Algebraic Combinatorics: An International Journal, 16:2, (209-223), Online publication date: 19-Nov-2002.
- Figueiredo M and Jain A (2002). Unsupervised Learning of Finite Mixture Models, IEEE Transactions on Pattern Analysis and Machine Intelligence, 24:3, (381-396), Online publication date: 1-Mar-2002.
- Schürmann A (2002). Dense ellipsoid packings, Discrete Mathematics, 247:1-3, (243-249), Online publication date: 28-Mar-2002.
- Coulson D (2002). A 15-colouring of 3-space omitting distance one, Discrete Mathematics, 256:1-2, (83-90), Online publication date: 28-Sep-2002.
- Choie Y and Solé P (2002). A Gleason Formula for Ozeki Polynomials, Journal of Combinatorial Theory Series A, 98:1, (60-73), Online publication date: 1-Apr-2002.
- Futamura N, Aluru S, Ranjan D and Hariharan B (2002). Efficient Parallel Algorithms for Solvent Accessible Surface Area of Proteins, IEEE Transactions on Parallel and Distributed Systems, 13:6, (544-555), Online publication date: 1-Jun-2002.
- Nebe G, Rains E and Sloane N (2001). The Invariants of the Clifford Groups, Designs, Codes and Cryptography, 24:1, (99-122), Online publication date: 13-Aug-2001.
- Huang H, Pardalos P and Shen Z (2001). A Point Balance Algorithm for the Spherical Code Problem, Journal of Global Optimization, 19:4, (329-344), Online publication date: 1-Apr-2001.
- Camastra F and Vinciarelli A (2001). Intrinsic Dimension Estimation of Data, Neural Processing Letters, 14:1, (27-34), Online publication date: 1-Aug-2001.
- Ibáñez L, Hamitouche C and Roux C (2001). A Vectorial Algorithm for Tracing Discrete Straight Lines in N-Dimensional Generalized Grids, IEEE Transactions on Visualization and Computer Graphics, 7:2, (97-108), Online publication date: 1-Apr-2001.
- Chen D, Hu X, Huang Y, Li Y and Xu J Algorithms for congruent sphere packing and applications Proceedings of the seventeenth annual symposium on Computational geometry, (212-221)
- Theußl T, Möller T and Gröller M Optimal regular volume sampling Proceedings of the conference on Visualization '01, (91-98)
- Choie Y, Mourrain B and Solé P (2001). Rankin-Cohen Brackets and Invariant Theory, Journal of Algebraic Combinatorics: An International Journal, 13:1, (5-13), Online publication date: 1-Jan-2001.
- Case J, Rajan D and Shende A (2001). Lattice computers for approximating Euclidean space, Journal of the ACM, 48:1, (110-144), Online publication date: 1-Jan-2001.
- Wang X and Orchard M Design of Trellis Codes for Source Coding with Side Information at the Decoder Proceedings of the Data Compression Conference
- Krejić N, Martínez J, Mello M and Pilotta E (2000). Validation of an Augmented Lagrangian Algorithm with a Gauss-Newton Hessian Approximation Using a Set of Hard-Spheres Problems, Computational Optimization and Applications, 16:3, (247-263), Online publication date: 1-Sep-2000.
- Bierbrauer J and Edel Y (2000). Dense Sphere Packings from New Codes, Journal of Algebraic Combinatorics: An International Journal, 11:2, (95-100), Online publication date: 1-Mar-2000.
- Baxter R and Oliver J (2000). Finding overlapping components with MML, Statistics and Computing, 10:1, (5-16), Online publication date: 1-Jan-2000.
- Wallace C and Dowe D (2000). MML clustering of multi-state, Poisson, vonMises circular and Gaussian distributions, Statistics and Computing, 10:1, (73-83), Online publication date: 1-Jan-2000.
- L'Ecuyer P and Touzin R Fast combined multiple recursive generators with multipliers of the form a = ±2 ±2 Proceedings of the 32nd conference on Winter simulation, (683-689)
- Bachoc C, Gulliver T and Harada M (2000). Isodual Codes over {\bb Z}_{2k} and Isodual Lattices, Journal of Algebraic Combinatorics: An International Journal, 12:3, (223-240), Online publication date: 1-Nov-2000.
- Pradhan S and Ramchandran K Distributed Source Coding Proceedings of the Conference on Data Compression
- Kelner J, Goyal V and Kovacevic J Multiple Description Lattice Vector Quantization Proceedings of the Conference on Data Compression
- Servetto S Lattice Quantization with Side Information Proceedings of the Conference on Data Compression
- Gaborit P and Harada M (1999). Construction of Extremal Type II Codes over \mbox{\zZ}_4, Designs, Codes and Cryptography, 16:3, (257-269), Online publication date: 1-May-1999.
- Svanström M (1999). A Class of Perfect Ternary Constant-Weight Codes, Designs, Codes and Cryptography, 18:1-3, (223-229), Online publication date: 1-Dec-1999.
- Bachoc C (1999). On Harmonic Weight Enumerators of Binary Codes, Designs, Codes and Cryptography, 18:1-3, (11-28), Online publication date: 1-Dec-1999.
- Calderbank A, Hardin R, Rains E, Shor P and Sloane N (1999). A Group-Theoretic Framework for the Construction of Packings in Grassmannian Spaces, Journal of Algebraic Combinatorics: An International Journal, 9:2, (129-140), Online publication date: 1-Mar-1999.
- Dougherty S, Gulliver T and Harada M (1999). Type II Self-Dual Codes over Finite Rings and Even Unimodular Lattices, Journal of Algebraic Combinatorics: An International Journal, 9:3, (233-250), Online publication date: 1-May-1999.
- Sidelnikov V (1999). Spherical 7-Designs in 2 ^n -Dimensional Euclidean Space, Journal of Algebraic Combinatorics: An International Journal, 10:3, (279-288), Online publication date: 1-Nov-1999.
- Gupta A Embedding tree metrics into low dimensional Euclidean spaces Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (694-700)
- Neil J, Wallace C and Korb K Learning Bayesian networks with restricted causal interactions Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence, (486-493)
- Harada M (1998). New Extremal Type II Codes Over Z _4, Designs, Codes and Cryptography, 13:3, (271-284), Online publication date: 1-Mar-1998.
- Banihashemi A and Khandani A (1998). An Inequality on the Coding Gain of Densest Lattice Packingsin Successive Dimensions, Designs, Codes and Cryptography, 14:3, (207-212), Online publication date: 1-Sep-1998.
- Raber U (1998). A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs, Journal of Global Optimization, 13:4, (417-432), Online publication date: 1-Dec-1998.
- Shor P and Sloane N (1998). A Family of Optimal Packings in Grassmannian Manifolds, Journal of Algebraic Combinatorics: An International Journal, 7:2, (157-163), Online publication date: 1-Mar-1998.
- Munzner T (1998). Exploring Large Graphs in 3D Hyperbolic Space, IEEE Computer Graphics and Applications, 18:4, (18-23), Online publication date: 1-Jul-1998.
- Calderbank A and Sloane N (1997). Double Circulant Codes over Z\!Z_{\bf 4} and Even Unimodular Lattices, Journal of Algebraic Combinatorics: An International Journal, 6:2, (119-131), Online publication date: 1-Apr-1997.
- Alon N (1997). Packings with large minimum kissing numbers, Discrete Mathematics, 175:1, (249-251), Online publication date: 15-Oct-1997.
- Miller G, Teng S, Thurston W and Vavasis S (1997). Separators for sphere-packings and nearest neighbor graphs, Journal of the ACM, 44:1, (1-29), Online publication date: 15-Jan-1997.
- Zong C (1996). The kissing numbers of tetrahedra, Discrete & Computational Geometry, 15:3, (239-252), Online publication date: 1-Mar-1996.
- Ashikhmin A and Litsyn S (1996). Fast Decoding Algorithms for First Order Reed-Muller and Related Codes, Designs, Codes and Cryptography, 7:3, (187-214), Online publication date: 1-Mar-1996.
- Gil J and Wagner A A New Technique for 3-D Domain Decomposition on Multicomputers which Reduces Message-Passing Proceedings of the 10th International Parallel Processing Symposium, (831-835)
- Ashikhmin A and Litsyn S (1996). Fast decoding of non-binary first order Reed-Muller codes, Applicable Algebra in Engineering, Communication and Computing, 7:4, (299-308), Online publication date: 1-Jul-1996.
- Zhigljavsky A and Chekmasov M (1996). Comparison of independent, stratified and random covering sample schemes in optimization problems, Mathematical and Computer Modelling: An International Journal, 23:8-9, (97-110), Online publication date: 21-Apr-1996.
- Sakamoto M and Morito S Combination of multiplicative congruential random-number generators with safe prime modulus Proceedings of the 27th conference on Winter simulation, (309-315)
- Eppstein D, Miller G and Teng S A deterministic linear time algorithm for geometric separators and its applications Proceedings of the ninth annual symposium on Computational geometry, (99-108)
- Xue G Parallel two-level simulated annealing Proceedings of the 7th international conference on Supercomputing, (357-366)
- Althöfer I, Das G, Dobkin D, Joseph D and Soares J (1993). On sparse spanners of weighted graphs, Discrete & Computational Geometry, 9:1, (81-100), Online publication date: 1-Dec-1993.
- Erdahl R (1992). A cone of inhomogeneous second-order polynomials, Discrete & Computational Geometry, 8:4, (387-416), Online publication date: 1-Dec-1992.
- Frieze A, Miller G and Teng S Separator based parallel divide and conquer in computational geometry Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, (420-429)
- Xue G, Maier R and Rosen J Minimizing the Lennard-Jones potential function on a massively parallel computer Proceedings of the 6th international conference on Supercomputing, (409-416)
- Coxeter H Orthogonal trees Proceedings of the seventh annual symposium on Computational geometry, (89-97)
- Schulze-Pillot R An algorithm for computing genera of ternary and quaternary quadratic forms Proceedings of the 1991 international symposium on Symbolic and algebraic computation, (134-143)
- Max N Computer assisted sphere packing in higher dimensions Proceedings of the 2nd conference on Visualization '91, (102-108)
Index Terms
- Sphere-packings, lattices, and groups
Recommendations
Integrally Closed Residuated Lattices
AbstractA residuated lattice is said to be integrally closed if it satisfies the quasiequations and , or equivalently, the equations and . Every integral, cancellative, or divisible residuated lattice is integrally closed,...
On Gelfand residuated lattices
AbstractIn this paper, a combination of algebraic and topological methods is applied to obtain new and structural results on Gelfand residuated lattices. It is demonstrated that Gelfand’s residuated lattices strongly tied up with the hull–kernel topology. ...
Residuated skew lattices
AbstractSkew lattices are one of the most successful non-commutative generalizations of lattices. Motivated by the study of residuation on ordered structures and that of skew Boolean algebras and skew Heyting algebras, in this paper, we ...