作者: commute 時(shí)間: 2025-3-21 20:41
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/232246.jpg作者: peptic-ulcer 時(shí)間: 2025-3-22 01:54 作者: 委派 時(shí)間: 2025-3-22 06:53
https://doi.org/10.1007/978-3-8349-9114-0inary nonlinear codes better than comparable binary linear codes. This connection between linear codes over . . and nonlinear binary codes was also the breakthrough in solving an old puzzle of the apparent duality between the nonlinear Kerdock and Preparata codes. We present a description of this puzzle and a brief introduction to codes over . ..作者: 不持續(xù)就爆 時(shí)間: 2025-3-22 09:48 作者: FILTH 時(shí)間: 2025-3-22 15:25 作者: FILTH 時(shí)間: 2025-3-22 17:44 作者: Obligatory 時(shí)間: 2025-3-22 23:17
https://doi.org/10.1007/978-3-8349-9114-0The . is defined as follows: Given a metric space . and a fixed finite subset . ? . of . “sites”, preprocess . and build a data structure so that queries of the following kind can be answered efficiently: Given a point . find one of the points . closest to . (see Figure 1).作者: EXUDE 時(shí)間: 2025-3-23 02:53 作者: Congregate 時(shí)間: 2025-3-23 09:17
https://doi.org/10.1007/3-7908-1690-6A . with one check character over an alphabet . is a code . which is used to detect (but not in general to correct) single errors (i.e. errors in one component) and other errors of certain patterns (discussed below).作者: 內(nèi)部 時(shí)間: 2025-3-23 13:03 作者: assent 時(shí)間: 2025-3-23 14:02
The Nearest Neighbor,The . is defined as follows: Given a metric space . and a fixed finite subset . ? . of . “sites”, preprocess . and build a data structure so that queries of the following kind can be answered efficiently: Given a point . find one of the points . closest to . (see Figure 1).作者: 證明無(wú)罪 時(shí)間: 2025-3-23 21:24 作者: 推崇 時(shí)間: 2025-3-24 01:38 作者: 航海太平洋 時(shí)間: 2025-3-24 03:55
https://doi.org/10.1007/978-3-8349-9114-0ods are simple, sometimes even the analysis is. The simplicity of the methods entails that they use very little of the underlying structure of the problems to tackle, and, as a consequence, they are applicable to a whole range of problems. Most prominently, they have led to new bounds for combinator作者: 松雞 時(shí)間: 2025-3-24 09:19 作者: 緯度 時(shí)間: 2025-3-24 11:13 作者: instulate 時(shí)間: 2025-3-24 16:59 作者: 障礙 時(shí)間: 2025-3-24 20:33 作者: 談判 時(shí)間: 2025-3-24 23:34 作者: cliche 時(shí)間: 2025-3-25 07:09 作者: Banquet 時(shí)間: 2025-3-25 09:49
https://doi.org/10.1007/978-3-658-38187-5in high dimensions (in particular for . ≥ 561, due to Kahn & Kalai, Nilli, and Raigorodskii), and yields the known counter-examples to Borsuk’s problem posed in 1933..Here we ask whether there might be counterexamples in low dimension as well. We show that there is no counterexample to the 0/1-Borsu作者: 散開(kāi) 時(shí)間: 2025-3-25 12:41
Codes over ,, ,inary nonlinear codes better than comparable binary linear codes. This connection between linear codes over . . and nonlinear binary codes was also the breakthrough in solving an old puzzle of the apparent duality between the nonlinear Kerdock and Preparata codes. We present a description of this puzzle and a brief introduction to codes over . ..作者: AMBI 時(shí)間: 2025-3-25 16:14
Degree Bounds for Long Paths and Cycles in ,-Connected Graphs,the vertex set .. To see this, consider a longest .-path . and a longest .- path . in . For the first vertex . on . in . we then have . and ., consequently .. Here . and |G| denote the number of vertices on . and in . respectively.作者: 全部 時(shí)間: 2025-3-25 23:51 作者: Apoptosis 時(shí)間: 2025-3-26 01:50
https://doi.org/10.1007/3-540-45506-XComputer; Discrete mathematics; Mapping; algorithms; coding; coding theory; combinatorics; computational al作者: 拾落穗 時(shí)間: 2025-3-26 06:20
978-3-540-42775-9Springer-Verlag Berlin Heidelberg 2001作者: PANIC 時(shí)間: 2025-3-26 08:31 作者: Ganglion-Cyst 時(shí)間: 2025-3-26 16:25 作者: Outshine 時(shí)間: 2025-3-26 18:20
Explicit and Implicit Enforcing - Randomized Optimization,veral linear time methods are available, and some of them even behave ‘well’ when the dimension grows; at least, no better provable behavior is known. Many of the methods can be interpreted as variants of the simplex algorithm, with appropriately chosen randomized pivot rules.作者: 必死 時(shí)間: 2025-3-26 21:19
Algorithms in Pure Mathematics,dvanced questions is a deep mathematical problem, which uses many results in pure mathematics, and even more important, raises new questions in pure mathematics. So we can say that looking for algorithms is part of pure mathematics, moreover it is a highly nontrivial part.作者: 確定無(wú)疑 時(shí)間: 2025-3-27 04:57
Christian Seidl,Joachim Jickelitain information about the distribution of the project makespan. We will demonstrate that this is an #.-complete problem in general, and then consider several combinatorial methods to obtain approximate information about the makespan distribution.作者: 永久 時(shí)間: 2025-3-27 05:34
Scheduling under Uncertainty: Bounding the Makespan Distribution,tain information about the distribution of the project makespan. We will demonstrate that this is an #.-complete problem in general, and then consider several combinatorial methods to obtain approximate information about the makespan distribution.作者: cushion 時(shí)間: 2025-3-27 10:51
Textbook 2001f theoretical computer scientists and mathematicians in order to support doctoral students and advanced ongoing education in the field of discrete mathematics and algorithmics..The 12 selected lectures by leading researchers presented in this book provide recent research results and advanced topics 作者: Emg827 時(shí)間: 2025-3-27 13:44
Textbook 2001hematics and algorithmics..The 12 selected lectures by leading researchers presented in this book provide recent research results and advanced topics in a coherent and consolidated way. Among the areas covered are combinatorics, graph theory, coding theory, discrete and computational geometry, optimization, and algorithmic aspects of algebra.作者: 滲入 時(shí)間: 2025-3-27 21:10
Steuern und Soziale Sicherung in Deutschlandommutative ring which is not a field, for example when the entries are integers, polynomials, or rational or even more complicated expressions. Such determinants arise in combinatorial problems, see [.].作者: 非實(shí)體 時(shí)間: 2025-3-27 22:29 作者: monologue 時(shí)間: 2025-3-28 05:52 作者: oracle 時(shí)間: 2025-3-28 06:32
Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions,k conjecture in dimensions . ≤ 9. (In contrast, the general Borsuk conjecture is open even for . = 4.).Our study relates the 0/1-case of Borsuk’s problem to the coloring problem for the Hamming graphs, to the geometry of a Hamming code, as well as to some upper bounds for the sizes of binary codes.作者: 巨碩 時(shí)間: 2025-3-28 12:09 作者: 記憶 時(shí)間: 2025-3-28 15:31
0302-9743 ars in Berlin, Germany, as a joint effort of theoretical computer scientists and mathematicians in order to support doctoral students and advanced ongoing education in the field of discrete mathematics and algorithmics..The 12 selected lectures by leading researchers presented in this book provide r作者: 享樂(lè)主義者 時(shí)間: 2025-3-28 19:59
Explicit and Implicit Enforcing - Randomized Optimization,ods are simple, sometimes even the analysis is. The simplicity of the methods entails that they use very little of the underlying structure of the problems to tackle, and, as a consequence, they are applicable to a whole range of problems. Most prominently, they have led to new bounds for combinator作者: 松緊帶 時(shí)間: 2025-3-29 00:18
Codes over ,, ,inary nonlinear codes better than comparable binary linear codes. This connection between linear codes over . . and nonlinear binary codes was also the breakthrough in solving an old puzzle of the apparent duality between the nonlinear Kerdock and Preparata codes. We present a description of this pu作者: hurricane 時(shí)間: 2025-3-29 05:09 作者: 口訣法 時(shí)間: 2025-3-29 08:28
,Data Structures for Boolean Functions BDDs — Foundations and Applications, data structure for representation of Boolean functions in electronic design automation (EDA)..An overview is given about the data structure, its properties, algorithmic behaviour, and the most important applications. Proofs and technical details have been omitted but can be found all in [.].作者: landmark 時(shí)間: 2025-3-29 11:32
Scheduling under Uncertainty: Bounding the Makespan Distribution,occur during project execution. A typical consequence is the underestimation of the expected project duration and cost frequently observed in practice. This phenomenon occurs even in the absence of resource constraints, and has been the subject of extensive research in discrete mathematics and opera作者: Angiogenesis 時(shí)間: 2025-3-29 18:15
Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approachations, and divisions. On the other hand, the explicit definition of the determinant as the sum of .! products, . shows that the determinant can be computed . divisions. The summation is taken over the set of all permutations π of . elements. Avoiding divisions seems attractive when working over a c作者: 社團(tuán) 時(shí)間: 2025-3-29 20:15
