Results 111 to 120 of about 87,317 (145)
Some of the next articles are maybe not open access.
Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, 2015
Advanced analytical applications that will enable the smart grid need to analyze the connectivity of the power grid under multiple different operating scenarios, taking into account time-varying topology of the grid. This paper proposes a highly memory-efficient representation of the power grid that enables efficient construction of multiple ...
Amith Singhee +5 more
openaire +1 more source
Advanced analytical applications that will enable the smart grid need to analyze the connectivity of the power grid under multiple different operating scenarios, taking into account time-varying topology of the grid. This paper proposes a highly memory-efficient representation of the power grid that enables efficient construction of multiple ...
Amith Singhee +5 more
openaire +1 more source
Proceedings of the 24th Annual International Conference on Mobile Computing and Networking, 2018
Road safety is a major public health issue the world over. Many studies have found that the primary factors responsible for road accidents center on the driver and her/his driving. Hence, there is the need to monitor driver's state and her/his driving, with a view to providing effective feedback.
Akshay Uttama Nambi +7 more
openaire +1 more source
Road safety is a major public health issue the world over. Many studies have found that the primary factors responsible for road accidents center on the driver and her/his driving. Hence, there is the need to monitor driver's state and her/his driving, with a view to providing effective feedback.
Akshay Uttama Nambi +7 more
openaire +1 more source
Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '82, 1982
An approximate analytical method for estimating performance statistics of general closed queueing network models of computing systems is presented. These networks may include queues with priority scheduling disciplines and non-exponential servers and several classes of jobs.
Neuse, Doug, Chandy, K. Mani
openaire +2 more sources
An approximate analytical method for estimating performance statistics of general closed queueing network models of computing systems is presented. These networks may include queues with priority scheduling disciplines and non-exponential servers and several classes of jobs.
Neuse, Doug, Chandy, K. Mani
openaire +2 more sources
Fuzzy hamming distinguishability
2017 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), 2017Back in 1967 the Croat linguist Ž. Muljacic had used a fuzzy generalization of the Hamming distance between binary strings to classify Romance languages. In 1956 Cl. Shannon had introduced the notion of codeword distinguishability in zero-error information theory. Distance and distinguishability are subtly different notions, even if, with distances as
Laura Franzoi, Andrea Sgarro
openaire +2 more sources
Intersection of Hamming codes avoiding Hamming subcodes
Designs, Codes and Cryptography, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rifà, J. +2 more
openaire +2 more sources
Hamming Matrix and Hamming Energy of a Graph
Match Communications in Mathematical and in Computer ChemistryHamming distance is a highly valuable quantity in computer science. In this work, we establish the Hamming matrix H of a graph G, H(G). This is a square matrix, where the elements of the H(G) are Hamming distances. Also, we define the Hamming energy of a graph, HE(G), which is a sum of the absolute eigenvalues of H(G).
Nemanja Vučićević +2 more
openaire +1 more source
Hamming-Codes und erweiterte Hamming-Codes
1991Nach Satz 11.5c kann man einen 1-fehlerkorrigierenden binaren Code konstruieren, indem man als Kontrollmatrix eine Matrix mit paarweise verschiedenen Spalten ungleich 0 nimmt. Wir behandeln nun den Fall mit maximaler Spaltenzahl n bei gegebener Zeilenzahl r (- dabei ist r = n – k die Anzahl der Paritatskontrollen). Es existieren genau n = 2 r – 1 von 0
openaire +1 more source