Добірка наукової літератури з теми "Signed hypercubes"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Signed hypercubes".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Signed hypercubes"
Shi, Wei. "The signed (|G| –1)-subdomination number of balanced hypercubes." Journal of Physics: Conference Series 1978, no. 1 (July 1, 2021): 012040. http://dx.doi.org/10.1088/1742-6596/1978/1/012040.
Повний текст джерелаLobov, Alexander A., and 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.
Повний текст джерелаMou, Gufang, and 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.
Повний текст джерелаSeo, Jung-Hyun, and Hyeong-Ok Lee. "Design and Analysis of a Symmetric Log Star Graph with a Smaller Network Cost Than Star Graphs." Electronics 10, no. 8 (April 20, 2021): 981. http://dx.doi.org/10.3390/electronics10080981.
Повний текст джерелаTsai, Chang-Hsiung, and Shu-Yun Jiang. "Path bipancyclicity of hypercubes." Information Processing Letters 101, no. 3 (February 2007): 93–97. http://dx.doi.org/10.1016/j.ipl.2006.08.011.
Повний текст джерелаGregor, Petr, and Tomáš Dvořák. "Path partitions of hypercubes." Information Processing Letters 108, no. 6 (November 2008): 402–6. http://dx.doi.org/10.1016/j.ipl.2008.07.015.
Повний текст джерелаChen, Xie-Bin. "On path bipancyclicity of hypercubes." Information Processing Letters 109, no. 12 (May 2009): 594–98. http://dx.doi.org/10.1016/j.ipl.2009.02.009.
Повний текст джерелаMa, Meijie, and Baodong Liu. "Cycles embedding in exchanged hypercubes." Information Processing Letters 110, no. 2 (December 2009): 71–76. http://dx.doi.org/10.1016/j.ipl.2009.10.009.
Повний текст джерелаLoh, P. K. K., W. J. Hsu, and Y. Pan. "The exchanged hypercube." IEEE Transactions on Parallel and Distributed Systems 16, no. 9 (September 2005): 866–74. http://dx.doi.org/10.1109/tpds.2005.113.
Повний текст джерелаCybenko, George, David W. Krumme, and K. N. Venkataraman. "Fixed hypercube embedding." Information Processing Letters 25, no. 1 (April 1987): 35–39. http://dx.doi.org/10.1016/0020-0190(87)90090-1.
Повний текст джерелаДисертації з теми "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.
Повний текст джерелаComplexity 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.
Повний текст джерелаКниги з теми "Signed hypercubes"
Corinthios, Michael J. Hypercubes, Kronecker Products and Sorting in Digital Signal Processing. Nova Science Publishers, Incorporated, 2017.
Знайти повний текст джерелаЧастини книг з теми "Signed hypercubes"
Henkel, Charles S., and Robert J. Plemmons. "Parallel Recursive Least Squares on a Hypercube Multiprocessor." In 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.
Повний текст джерелаBeernaert, L., D. Roose, S. Van Praet, and P. de Groen. "Parallel Gaussian Elimination, iPSC/2 Hypercube versus a Transputer Network." In 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.
Повний текст джерелаТези доповідей конференцій з теми "Signed hypercubes"
Blyth, R. "Signal constellations based on hypercubes." In 5th IEE Conference on Telecommunications. IEE, 1995. http://dx.doi.org/10.1049/cp:19950117.
Повний текст джерелаFrey, Alexander H. "Hypercube Architectures And Their Application To Signal Processing." In O-E/LASE'86 Symp (January 1986, Los Angeles), edited by Keith Bromley. SPIE, 1986. http://dx.doi.org/10.1117/12.960500.
Повний текст джерелаHuang, Kung-Shiuh, B. K. Jenkins, and A. A. Sawchuk. "Programming a digital optical cellular image processor." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1987. http://dx.doi.org/10.1364/oam.1987.tha6.
Повний текст джерелаAlzeidi, N., M. Ould-Khaoua, and J. Ferguson. "Hypercube versus Torus under Pin-Out Constraint and Finite Buffers." In 2007 IEEE International Conference on Signal Processing and Communications. IEEE, 2007. http://dx.doi.org/10.1109/icspc.2007.4728376.
Повний текст джерелаChristodoulou, Lakis, Takis Kasparis, and Hari Kalva. "Performance evaluation of the Hypercube based Prediction Algorithm for Multi-View Video Coding." In 2009 16th International Conference on Digital Signal Processing (DSP). IEEE, 2009. http://dx.doi.org/10.1109/icdsp.2009.5201064.
Повний текст джерелаAnsari, A. R., and F. J. Taylor. "UF/sup 3/-a 4-D DSP hypercube with a robust programming environment." In [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing. IEEE, 1992. http://dx.doi.org/10.1109/icassp.1992.226541.
Повний текст джерелаFeldman, Michael R., and Clark C. Guest. "Optical Interconnect Complexity Limitations for Holograms Fabricated with Electron Beam Lithography." In Optical Computing. Washington, D.C.: Optica Publishing Group, 1987. http://dx.doi.org/10.1364/optcomp.1987.me2.
Повний текст джерелаChatti, Majed, Sami Yehia, Claude Timsit, and Soraya Zertal. "A hypercube-based NoC routing algorithm for efficient all-to-all communications in embedded image and signal processing applications." In Simulation (HPCS). IEEE, 2010. http://dx.doi.org/10.1109/hpcs.2010.5547065.
Повний текст джерелаUrquhart, Kristopher S., Philippe Marchand, Yeshaiahu Fainman, and Sing H. Lee. "Design of free-space optical interconnection systems utilizing diffractive optics." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1991. http://dx.doi.org/10.1364/oam.1991.tus7.
Повний текст джерелаRezaveisi, Mohsen, Jennifer L. Campbell, Paula L. Wigley, Tyler M. Foster, and Doug G. Peck. "Development Plan Optimization and Uncertainty Study in a Major Deepwater Field in the US Gulf of Mexico." In Offshore Technology Conference. OTC, 2023. http://dx.doi.org/10.4043/32622-ms.
Повний текст джерела