標(biāo)題: Titlebook: Discrete Probability and Algorithms; David Aldous,Persi Diaconis,J. Michael Steele Conference proceedings 1995 Springer Science+Business M [打印本頁] 作者: CANTO 時間: 2025-3-21 18:20
書目名稱Discrete Probability and Algorithms影響因子(影響力)
書目名稱Discrete Probability and Algorithms影響因子(影響力)學(xué)科排名
書目名稱Discrete Probability and Algorithms網(wǎng)絡(luò)公開度
書目名稱Discrete Probability and Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete Probability and Algorithms被引頻次
書目名稱Discrete Probability and Algorithms被引頻次學(xué)科排名
書目名稱Discrete Probability and Algorithms年度引用
書目名稱Discrete Probability and Algorithms年度引用學(xué)科排名
書目名稱Discrete Probability and Algorithms讀者反饋
書目名稱Discrete Probability and Algorithms讀者反饋學(xué)科排名
作者: 牽連 時間: 2025-3-21 22:13
Endoscopic Examination of the Esophagusand column sums. The combinatorial problems include counting magic squares, enumerating permutations by descent patterns and a variety of problems in representation theory. The statistical problems involve goodness of fit tests for contingency tables. We review these problems along with the available techniques for exact and approximate solution.作者: insidious 時間: 2025-3-22 01:50
https://doi.org/10.1007/978-1-4613-4283-0r the transition probabilities and stationary distribution of the permutation chain. The spectral structure of the chain is presented explicitly. Bounds on the discrepancy from stationarity for the permutation chain are computed in terms of the corresponding discrepancy for the request chain, both for separation and for total variation distance.作者: ACRID 時間: 2025-3-22 04:36
Victor H. Frankel,James W. Pughudorandom sequences as well as deterministic ones. Although most attention is given to previously published research, some new proofs and new results are given. In particular, some new phenomena are demonstrated for the monotonic subsequences of . of sequences. A number of open problems from the literature are also surveyed.作者: Forsake 時間: 2025-3-22 09:57 作者: 符合規(guī)定 時間: 2025-3-22 13:59
Rectangular Arrays with Fixed Margins,and column sums. The combinatorial problems include counting magic squares, enumerating permutations by descent patterns and a variety of problems in representation theory. The statistical problems involve goodness of fit tests for contingency tables. We review these problems along with the available techniques for exact and approximate solution.作者: 符合規(guī)定 時間: 2025-3-22 18:30 作者: 歡樂中國 時間: 2025-3-22 21:16 作者: Resection 時間: 2025-3-23 01:31
Diencephalic Surgery for the Relief of PainWe present an algorithm which, given a .-state Markov chain whose steps can be simulated, outputs a random state whose distribution is within . of the stationary distribution, using .(.)space and .(?-2τ) time, where is a certain “average hitting time” parameter of the chain.作者: SOBER 時間: 2025-3-23 06:10
M. V. Braimbridge,D. J. Hearse,D. A. StewartWe survey a number of algorithms that decide connectivity in undirected graphs. Our focus is on the use of random walks as a tool in reducing the space complexity of these algorithms.作者: 通情達理 時間: 2025-3-23 11:57
M. V. Braimbridge,B. A. Ross,M. DaviesLet . denote the set of positive integers. A set .?. is called a . if the sums . + . (.?.) are all distinct. For background on Sidon sets, we refer to [6]. For additional recent results see [2], [3]. In this paper we are interested in infinite Sidon sets, thus for the rest of the discussion all Sidon sets are infinite unless, otherwise specified.作者: oxidant 時間: 2025-3-23 15:01 作者: Indurate 時間: 2025-3-23 20:39 作者: 鬼魂 時間: 2025-3-23 23:37
Sidon Sets with Small Gaps,Let . denote the set of positive integers. A set .?. is called a . if the sums . + . (.?.) are all distinct. For background on Sidon sets, we refer to [6]. For additional recent results see [2], [3]. In this paper we are interested in infinite Sidon sets, thus for the rest of the discussion all Sidon sets are infinite unless, otherwise specified.作者: ATRIA 時間: 2025-3-24 02:47 作者: acolyte 時間: 2025-3-24 09:36 作者: Expressly 時間: 2025-3-24 10:50
Gerrit Krupski-Berdien MD,Volkmar Nicolas MD resolve issues in theoretical computer science. This paper presents three examples which are used to illustrate both parts: a Markov chain algorithm for estimating the tails of the bootstrap also illustrates the Jerrum-Sinclair theory of approximate counting. The Geyer-Thompson work on Monte-Carlo 作者: Landlocked 時間: 2025-3-24 15:48
https://doi.org/10.1007/978-1-4613-4283-0r the transition probabilities and stationary distribution of the permutation chain. The spectral structure of the chain is presented explicitly. Bounds on the discrepancy from stationarity for the permutation chain are computed in terms of the corresponding discrepancy for the request chain, both f作者: allude 時間: 2025-3-24 21:53 作者: Dorsal 時間: 2025-3-24 23:22
Victor H. Frankel,James W. Pughudorandom sequences as well as deterministic ones. Although most attention is given to previously published research, some new proofs and new results are given. In particular, some new phenomena are demonstrated for the monotonic subsequences of . of sequences. A number of open problems from the lit作者: FUSE 時間: 2025-3-25 06:11 作者: fringe 時間: 2025-3-25 11:32 作者: 集合 時間: 2025-3-25 15:27
https://doi.org/10.1007/978-1-4612-0801-3Markov chain; Probability theory; algorithms; combinatorics; network; random walk; sets作者: nutrition 時間: 2025-3-25 17:00 作者: 用肘 時間: 2025-3-25 23:21
Three Examples of Monte-Carlo Markov Chains: At the Interface Between Statistical Computing, Computevaluation of maximum likelihood is compared with work on evaluation of the partition function. Finally, work of Diaconis-Sturmfels on conditional inference is complemented by the work of theoretical computer scientists on approximate computation of the volume of convex polyhedra.作者: frivolous 時間: 2025-3-26 02:36
,Randomised Approximation Schemes for Tutte-Gr?thendieck Invariants,ven for the very restricted class of planar bipartite graphs. However the question of which points have a fully polynomial randomised approximation scheme is wide open. I shall discuss this problem and give a survey of what is currently known.作者: CYN 時間: 2025-3-26 05:58
0940-6573 ership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world‘s leading experts in the field.作者: 載貨清單 時間: 2025-3-26 10:21
Brain Stimulation for Pain Controle, as usual, the cut determined by ., i.e., the set of all edges of . with an end in . and an end in its complement .. Define . and observe that .(.) is simply the expected number of edges of . that lie in the cut (.,). In this note we prove the following.作者: 宿醉 時間: 2025-3-26 14:30 作者: Bereavement 時間: 2025-3-26 18:45
0940-6573 of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance..978-1-4612-6905-2978-1-4612-0801-3Series ISSN 0940-6573 Series E-ISSN 2198-3224 作者: lymphedema 時間: 2025-3-26 22:33 作者: 流動才波動 時間: 2025-3-27 02:24
The Asymptotic Lower Bound on the Diagonal Ramsey Numbers: A Closer Look, that of a Poisson random variable, and that (ii) with . representing the number of .-cliques with exactly . edges of one color, the joint distribution of (.0, .1,..., .b) can be approximated by a multidimensional Poisson vector with independent components provided that . = .(.).作者: 強制令 時間: 2025-3-27 08:59 作者: JUST 時間: 2025-3-27 09:45 作者: Dappled 時間: 2025-3-27 15:08
Trauma, Hip Development, and Vascularityven for the very restricted class of planar bipartite graphs. However the question of which points have a fully polynomial randomised approximation scheme is wide open. I shall discuss this problem and give a survey of what is currently known.作者: 礦石 時間: 2025-3-27 18:45 作者: 叢林 時間: 2025-3-28 01:23 作者: gusher 時間: 2025-3-28 05:21
Conference proceedings 1995back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world‘s leading experts in the field...Research作者: arthroscopy 時間: 2025-3-28 06:23 作者: 內(nèi)行 時間: 2025-3-28 12:49 作者: painkillers 時間: 2025-3-28 15:03 作者: DEVIL 時間: 2025-3-28 21:29
The Move-To-Front Rule for Self-Organizing Lists with Markov Dependent Requests,r the transition probabilities and stationary distribution of the permutation chain. The spectral structure of the chain is presented explicitly. Bounds on the discrepancy from stationarity for the permutation chain are computed in terms of the corresponding discrepancy for the request chain, both f作者: 同謀 時間: 2025-3-28 23:29 作者: 一加就噴出 時間: 2025-3-29 03:12 作者: 植物群 時間: 2025-3-29 07:41 作者: Permanent 時間: 2025-3-29 11:36 作者: barium-study 時間: 2025-3-29 18:28
