Littérature scientifique sur le sujet « Signed hypercubes »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Signed hypercubes ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Signed hypercubes"
Shi, Wei. « The signed (|G| –1)-subdomination number of balanced hypercubes ». Journal of Physics : Conference Series 1978, no 1 (1 juillet 2021) : 012040. http://dx.doi.org/10.1088/1742-6596/1978/1/012040.
Texte intégralLobov, Alexander A., et Mikhail B. Abrosimov. « About uniqueness of the minimal 1-edge extension of hypercube Q4 ». Prikladnaya Diskretnaya Matematika, no 58 (2023) : 84–93. http://dx.doi.org/10.17223/20710410/58/8.
Texte intégralMou, Gufang, et Qiuyan Zhang. « Signed zero forcing number and controllability for a networks system with a directed hypercube ». MATEC Web of Conferences 355 (2022) : 01012. http://dx.doi.org/10.1051/matecconf/202235501012.
Texte intégralSeo, Jung-Hyun, et Hyeong-Ok Lee. « Design and Analysis of a Symmetric Log Star Graph with a Smaller Network Cost Than Star Graphs ». Electronics 10, no 8 (20 avril 2021) : 981. http://dx.doi.org/10.3390/electronics10080981.
Texte intégralTsai, Chang-Hsiung, et Shu-Yun Jiang. « Path bipancyclicity of hypercubes ». Information Processing Letters 101, no 3 (février 2007) : 93–97. http://dx.doi.org/10.1016/j.ipl.2006.08.011.
Texte intégralGregor, Petr, et Tomáš Dvořák. « Path partitions of hypercubes ». Information Processing Letters 108, no 6 (novembre 2008) : 402–6. http://dx.doi.org/10.1016/j.ipl.2008.07.015.
Texte intégralChen, Xie-Bin. « On path bipancyclicity of hypercubes ». Information Processing Letters 109, no 12 (mai 2009) : 594–98. http://dx.doi.org/10.1016/j.ipl.2009.02.009.
Texte intégralMa, Meijie, et Baodong Liu. « Cycles embedding in exchanged hypercubes ». Information Processing Letters 110, no 2 (décembre 2009) : 71–76. http://dx.doi.org/10.1016/j.ipl.2009.10.009.
Texte intégralLoh, P. K. K., W. J. Hsu et Y. Pan. « The exchanged hypercube ». IEEE Transactions on Parallel and Distributed Systems 16, no 9 (septembre 2005) : 866–74. http://dx.doi.org/10.1109/tpds.2005.113.
Texte intégralCybenko, George, David W. Krumme et K. N. Venkataraman. « Fixed hypercube embedding ». Information Processing Letters 25, no 1 (avril 1987) : 35–39. http://dx.doi.org/10.1016/0020-0190(87)90090-1.
Texte intégralThèses sur le sujet "Signed hypercubes"
Sunny, Anupa. « Complexity measures through the lens of two-player games and signatures of the hypercube ». Electronic Thesis or Diss., Université Paris Cité, 2023. http://www.theses.fr/2023UNIP7070.
Texte intégralComplexity measures of Boolean functions capture various aspects of the hardness of computing a function and their study is about finding connections between different complexity measures. In the first part of this thesis, we introduce and study Certificate Game complexity, a measure of complexity based on the probability of winning a game in which two players are given inputs with different function values and are asked to output some index i where their inputs differ, in a zero-communication setting. We give upper and lower bounds for private coin, public coin, shared entanglement and non-signaling strategies, and give some separations. We show that complexity in the public coin model is bounded above by Randomised query and Certificate complexities. On the other hand, it is bounded below by fractional certificate complexity, making it a good candidate to prove strong lower bounds on randomised query complexity. Complexity in the private coin model is bounded below by zero-error randomised query complexity. The quantum measure highlights an interesting and surprising difference between classical and quantum query models. While public coin certificate game complexity is bounded above by randomised query complexity, quantum certificate game complexity can be quadratically larger than quantum query complexity. We use non-signaling, a notion from quantum information, to give a lower bound of n on the quantum certificate game complexity of the OR function, whose quantum query complexity is Θ(√n) and then go on to show that this "non-signaling bottleneck" applies to all functions with high sensitivity, block sensitivity or fractional block sensitivity. We also consider the single-bit version of certificate games, where the inputs of the two players are restricted to having Hamming distance 1. We prove that the single-bit version of certificate game complexity with shared randomness is equal to sensitivity up to constant factors, thus giving a new characterization of sensitivity. On the other hand, the single-bit version of certificate game complexity with private randomness is equal to λ2, where λ is the spectral sensitivity. In the second part of this thesis, we revisit the celebrated proof of the sensitivity conjecture by Hao Huang. Using spectral techniques, Huang proved that every subgraph of the hypercube Hn of dimension n induced on more than half the vertices has maximum degree at least √n. Combined with earlier work, this completed a proof of the sensitivity conjecture. We show an alternate proof of Huang's result using only linear dependency of vectors associated with the vertices of the hypercube. Our approach helps gain insight on more structural properties of the induced subgraph in addition to the largest degree. In particular, we prove that in any induced subgraph of Hn with more than half the number of vertices, there are two vertices, one of odd parity and the other of even parity, each with at least n vertices at distance at most 2. As an application, we show that for any Boolean function f, the polynomial degree is bounded above by the product of 0-sensitivity and 1-sensitivity, s0(f)s1(f), a strictly stronger statement which implies Huang's theorem. We also obtain structural relations for induced subgraphs at distance 3. A key implement in Huang's proof was signed hypercubes with the property that every cycle of length 4 is assigned a negative sign. We take a detailed look at this signature and give a nearly optimal signature that uses the minimum number of negative edges while ensuring that every 4-cycle is negative. This problem turns out to be related to one of Erdös' problems on the largest 4-cycle free subgraph of the hypercube
Douimi, Mohammed. « Modélisation markovienne et optimisation numérique pour la restauration des signaux en (1D) et (2D) ». Rouen, 1995. http://www.theses.fr/1995ROUES039.
Texte intégralLivres sur le sujet "Signed hypercubes"
Corinthios, Michael J. Hypercubes, Kronecker Products and Sorting in Digital Signal Processing. Nova Science Publishers, Incorporated, 2017.
Trouver le texte intégralChapitres de livres sur le sujet "Signed hypercubes"
Henkel, Charles S., et Robert J. Plemmons. « Parallel Recursive Least Squares on a Hypercube Multiprocessor ». Dans Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, 571–77. Berlin, Heidelberg : Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-75536-1_43.
Texte intégralBeernaert, L., D. Roose, S. Van Praet et P. de Groen. « Parallel Gaussian Elimination, iPSC/2 Hypercube versus a Transputer Network ». Dans Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, 477–84. Berlin, Heidelberg : Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-75536-1_29.
Texte intégralActes de conférences sur le sujet "Signed hypercubes"
Blyth, R. « Signal constellations based on hypercubes ». Dans 5th IEE Conference on Telecommunications. IEE, 1995. http://dx.doi.org/10.1049/cp:19950117.
Texte intégralFrey, Alexander H. « Hypercube Architectures And Their Application To Signal Processing ». Dans O-E/LASE'86 Symp (January 1986, Los Angeles), sous la direction de Keith Bromley. SPIE, 1986. http://dx.doi.org/10.1117/12.960500.
Texte intégralHuang, Kung-Shiuh, B. K. Jenkins et A. A. Sawchuk. « Programming a digital optical cellular image processor ». Dans OSA Annual Meeting. Washington, D.C. : Optica Publishing Group, 1987. http://dx.doi.org/10.1364/oam.1987.tha6.
Texte intégralAlzeidi, N., M. Ould-Khaoua et J. Ferguson. « Hypercube versus Torus under Pin-Out Constraint and Finite Buffers ». Dans 2007 IEEE International Conference on Signal Processing and Communications. IEEE, 2007. http://dx.doi.org/10.1109/icspc.2007.4728376.
Texte intégralChristodoulou, Lakis, Takis Kasparis et Hari Kalva. « Performance evaluation of the Hypercube based Prediction Algorithm for Multi-View Video Coding ». Dans 2009 16th International Conference on Digital Signal Processing (DSP). IEEE, 2009. http://dx.doi.org/10.1109/icdsp.2009.5201064.
Texte intégralAnsari, A. R., et F. J. Taylor. « UF/sup 3/-a 4-D DSP hypercube with a robust programming environment ». Dans [Proceedings] ICASSP-92 : 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing. IEEE, 1992. http://dx.doi.org/10.1109/icassp.1992.226541.
Texte intégralFeldman, Michael R., et Clark C. Guest. « Optical Interconnect Complexity Limitations for Holograms Fabricated with Electron Beam Lithography ». Dans Optical Computing. Washington, D.C. : Optica Publishing Group, 1987. http://dx.doi.org/10.1364/optcomp.1987.me2.
Texte intégralChatti, Majed, Sami Yehia, Claude Timsit et Soraya Zertal. « A hypercube-based NoC routing algorithm for efficient all-to-all communications in embedded image and signal processing applications ». Dans Simulation (HPCS). IEEE, 2010. http://dx.doi.org/10.1109/hpcs.2010.5547065.
Texte intégralUrquhart, Kristopher S., Philippe Marchand, Yeshaiahu Fainman et Sing H. Lee. « Design of free-space optical interconnection systems utilizing diffractive optics ». Dans OSA Annual Meeting. Washington, D.C. : Optica Publishing Group, 1991. http://dx.doi.org/10.1364/oam.1991.tus7.
Texte intégralRezaveisi, Mohsen, Jennifer L. Campbell, Paula L. Wigley, Tyler M. Foster et Doug G. Peck. « Development Plan Optimization and Uncertainty Study in a Major Deepwater Field in the US Gulf of Mexico ». Dans Offshore Technology Conference. OTC, 2023. http://dx.doi.org/10.4043/32622-ms.
Texte intégral