標(biāo)題: Titlebook: Mathematical Foundations of Computer Science 2007; 32nd International S Luděk Ku?era,Antonín Ku?era Conference proceedings 2007 Springer-Ve [打印本頁] 作者: Destruct 時(shí)間: 2025-3-21 16:37
書目名稱Mathematical Foundations of Computer Science 2007影響因子(影響力)
書目名稱Mathematical Foundations of Computer Science 2007影響因子(影響力)學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2007網(wǎng)絡(luò)公開度
書目名稱Mathematical Foundations of Computer Science 2007網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2007被引頻次
書目名稱Mathematical Foundations of Computer Science 2007被引頻次學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2007年度引用
書目名稱Mathematical Foundations of Computer Science 2007年度引用學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2007讀者反饋
書目名稱Mathematical Foundations of Computer Science 2007讀者反饋學(xué)科排名
作者: Jacket 時(shí)間: 2025-3-21 20:58 作者: Throttle 時(shí)間: 2025-3-22 03:25 作者: 蜈蚣 時(shí)間: 2025-3-22 04:55 作者: Hot-Flash 時(shí)間: 2025-3-22 08:53 作者: 期滿 時(shí)間: 2025-3-22 15:24
Expander Properties and the Cover Time of Random Intersection Graphs (a) random intersection graphs are expanders, (b) random walks on such graphs are “rapidly mixing” (in particular they mix in logarithmic time) and (c) the cover time of random walks on such graphs is optimal (i.e. it is .(. log.)). All results are proved for . very close to the connectivity thresh作者: 儀式 時(shí)間: 2025-3-22 17:49 作者: vitreous-humor 時(shí)間: 2025-3-22 23:01
Rewriting Conjunctive Queries Determined by Viewstructing rewritings is a widely studied technique to derive those answers. In this paper we consider the problem of existence of rewritings in the case where the answers to the views uniquely determine the answers to the query. Specifically, we say that a view set .. a query . if for any two databas作者: HEDGE 時(shí)間: 2025-3-23 05:13
Approximation Algorithms for the Maximum Internal Spanning Tree Problemw, this problem is equivalent to the . problem, and is NP-hard as being a generalization of the . problem. Although there is no constant factor approximation for the . problem [1], . can be approximated within a factor of 2 [2]..In this paper we improve this factor by giving a .-approximation algori作者: altruism 時(shí)間: 2025-3-23 08:12
New Approximability Results for 2-Dimensional Packing Problemsmation schemes for this problem without and with 90. rotations. The additive constant in the approximation ratios of both algorithms is 1, improving on the additive term in the approximation ratios of the algorithm by Kenyon and Rémila (for the problem without rotations) and Jansen and van Stee (for作者: Genteel 時(shí)間: 2025-3-23 13:26 作者: sclera 時(shí)間: 2025-3-23 13:58 作者: 可卡 時(shí)間: 2025-3-23 18:26 作者: critic 時(shí)間: 2025-3-23 23:31
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoidse property, a one-to-one correspondence between .-uniform linear circuits, two-variable formulae with . predicates, and weak block products of monoids. In particular, we consider the case of linear TC., majority quantifiers, and finitely typed monoids. This correspondence will hold for any numerical作者: 摻和 時(shí)間: 2025-3-24 05:20
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Completeblem ., where . is any subprojective relational structure. As a consequence we get a new proof (not using universal algebra) that . is .-complete for any subprojective (and thus also projective) relational structure. This provides a starting point for a new combinatorial approach to the NP-completen作者: 透明 時(shí)間: 2025-3-24 07:53
NP by Means of Lifts and Shadowsese classes are defined by means of shadows (projections) and by finitely many forbidden colored (lifted) subgraphs. Our characterization is motivated by the analysis of syntactical subclasses with the full computational power of NP, which were first studied by Feder and Vardi..Our approach applies 作者: BLOT 時(shí)間: 2025-3-24 11:09 作者: 性冷淡 時(shí)間: 2025-3-24 17:40 作者: 說明 時(shí)間: 2025-3-24 20:32 作者: LUMEN 時(shí)間: 2025-3-25 02:23 作者: nonsensical 時(shí)間: 2025-3-25 04:40
Anuj Dawarand implementation advice from the experts.In .Neuronal Cell Culture: Methods and Protocols., the latest aspects of the culture of neural cells are explored by experts in the field who also explain the practical and theoretical considerations of the techniques involved.? Starting with a general over作者: Acetaminophen 時(shí)間: 2025-3-25 09:36 作者: EXCEL 時(shí)間: 2025-3-25 11:57 作者: 使虛弱 時(shí)間: 2025-3-25 19:10
Leslie G. Valiantand implementation advice from the experts.In .Neuronal Cell Culture: Methods and Protocols., the latest aspects of the culture of neural cells are explored by experts in the field who also explain the practical and theoretical considerations of the techniques involved.? Starting with a general over作者: Infant 時(shí)間: 2025-3-25 23:17
Sotiris E. Nikoletseas,Christoforos Raptopoulos,Paul G. Spirakisand implementation advice from the experts.In .Neuronal Cell Culture: Methods and Protocols., the latest aspects of the culture of neural cells are explored by experts in the field who also explain the practical and theoretical considerations of the techniques involved.? Starting with a general over作者: fulcrum 時(shí)間: 2025-3-26 02:50 作者: Chronic 時(shí)間: 2025-3-26 06:18
Christof L?ding,Alex Speltenand implementation advice from the experts.In .Neuronal Cell Culture: Methods and Protocols., the latest aspects of the culture of neural cells are explored by experts in the field who also explain the practical and theoretical considerations of the techniques involved.? Starting with a general over作者: infringe 時(shí)間: 2025-3-26 08:53 作者: 結(jié)合 時(shí)間: 2025-3-26 15:44 作者: 諂媚于人 時(shí)間: 2025-3-26 20:49
Klaus Jansen,Roberto Solis-Obaand implementation advice from the experts.In .Neuronal Cell Culture: Methods and Protocols., the latest aspects of the culture of neural cells are explored by experts in the field who also explain the practical and theoretical considerations of the techniques involved.? Starting with a general over作者: prostate-gland 時(shí)間: 2025-3-26 23:58
Yuichi Asahiro,Eiji Miyano,Toshihide Murata,Hirotaka Onoand implementation advice from the experts.In .Neuronal Cell Culture: Methods and Protocols., the latest aspects of the culture of neural cells are explored by experts in the field who also explain the practical and theoretical considerations of the techniques involved.? Starting with a general over作者: Acupressure 時(shí)間: 2025-3-27 05:00
Dirk Nowotka,Ji?í Srbaand implementation advice from the experts.In .Neuronal Cell Culture: Methods and Protocols., the latest aspects of the culture of neural cells are explored by experts in the field who also explain the practical and theoretical considerations of the techniques involved.? Starting with a general over作者: 舉止粗野的人 時(shí)間: 2025-3-27 07:18 作者: anus928 時(shí)間: 2025-3-27 12:18 作者: 增減字母法 時(shí)間: 2025-3-27 17:10 作者: Etching 時(shí)間: 2025-3-27 19:11 作者: hair-bulb 時(shí)間: 2025-3-28 00:51 作者: Coronary-Spasm 時(shí)間: 2025-3-28 02:47 作者: Fibrin 時(shí)間: 2025-3-28 07:59
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular GraphsWe present algorithmic lower bounds on the size .. of the largest independent sets of vertices in random .-regular graphs, for each fixed .?≥?3. For instance, for .?=?3 we prove that, for graphs on . vertices, ..?≥?0.43475 . with probability approaching one as . tends to infinity.作者: ALIBI 時(shí)間: 2025-3-28 11:33 作者: 騷動(dòng) 時(shí)間: 2025-3-28 18:14
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626141.jpg作者: Regurgitation 時(shí)間: 2025-3-28 21:58 作者: anchor 時(shí)間: 2025-3-29 02:51
Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemeses. Subsuming well-known classes of models of computation, these rich hierarchies (of word languages, trees, and graphs respectively) have excellent model-checking properties. In this extended abstract, we survey recent expressivity and decidability results about these infinite structures.作者: 易彎曲 時(shí)間: 2025-3-29 03:23
978-3-540-74455-9Springer-Verlag Berlin Heidelberg 2007作者: 歡騰 時(shí)間: 2025-3-29 10:05 作者: 暗指 時(shí)間: 2025-3-29 14:30
0302-9743 Overview: 978-3-540-74455-9978-3-540-74456-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Panacea 時(shí)間: 2025-3-29 17:57 作者: palliate 時(shí)間: 2025-3-29 20:51 作者: rods366 時(shí)間: 2025-3-30 03:43 作者: 進(jìn)步 時(shí)間: 2025-3-30 07:40
NP by Means of Lifts and Shadowss of coloring problems when restricted to most frequent graph classes. Using results of Ne?et?il and Ossona de Mendez for bounded expansion classes (which include bounded degree and proper minor closed classes) we prove that the restriction of every class defined as the shadow of finitely many color作者: consent 時(shí)間: 2025-3-30 08:15
e: Methods and Protocols. will be of interest to scientists at all levels developing cell culture models for neuroscientific studies.978-1-4939-6064-4978-1-62703-640-5Series ISSN 1064-3745 Series E-ISSN 1940-6029 作者: Airtight 時(shí)間: 2025-3-30 13:32
Va?ek Chvátale: Methods and Protocols. will be of interest to scientists at all levels developing cell culture models for neuroscientific studies.978-1-4939-6064-4978-1-62703-640-5Series ISSN 1064-3745 Series E-ISSN 1940-6029 作者: misanthrope 時(shí)間: 2025-3-30 17:56 作者: LEVER 時(shí)間: 2025-3-30 23:36 作者: employor 時(shí)間: 2025-3-31 03:37
C. -H. L. Onge: Methods and Protocols. will be of interest to scientists at all levels developing cell culture models for neuroscientific studies.978-1-4939-6064-4978-1-62703-640-5Series ISSN 1064-3745 Series E-ISSN 1940-6029 作者: tolerance 時(shí)間: 2025-3-31 08:23 作者: sed-rate 時(shí)間: 2025-3-31 10:15 作者: 植物群 時(shí)間: 2025-3-31 15:53 作者: Pigeon 時(shí)間: 2025-3-31 19:36
Christof L?ding,Alex Speltene: Methods and Protocols. will be of interest to scientists at all levels developing cell culture models for neuroscientific studies.978-1-4939-6064-4978-1-62703-640-5Series ISSN 1064-3745 Series E-ISSN 1940-6029 作者: ALLAY 時(shí)間: 2025-3-31 21:54 作者: 吹牛大王 時(shí)間: 2025-4-1 03:36
Gábor Salamone: Methods and Protocols. will be of interest to scientists at all levels developing cell culture models for neuroscientific studies.978-1-4939-6064-4978-1-62703-640-5Series ISSN 1064-3745 Series E-ISSN 1940-6029 作者: cancer 時(shí)間: 2025-4-1 07:35
Klaus Jansen,Roberto Solis-Obae: Methods and Protocols. will be of interest to scientists at all levels developing cell culture models for neuroscientific studies.978-1-4939-6064-4978-1-62703-640-5Series ISSN 1064-3745 Series E-ISSN 1940-6029 作者: constellation 時(shí)間: 2025-4-1 11:59 作者: hegemony 時(shí)間: 2025-4-1 16:40 作者: 鴿子 時(shí)間: 2025-4-1 20:57 作者: overture 時(shí)間: 2025-4-2 00:22
Christoph Behle,Andreas Krebs,Mark Mercere: Methods and Protocols. will be of interest to scientists at all levels developing cell culture models for neuroscientific studies.978-1-4939-6064-4978-1-62703-640-5Series ISSN 1064-3745 Series E-ISSN 1940-6029 作者: 參考書目 時(shí)間: 2025-4-2 03:15 作者: Blemish 時(shí)間: 2025-4-2 06:57
Gábor Kun,Jaroslav Ne?et?ildesign also allows for an establishment of a hydrostatic gradient when the volume in one chamber is greater than that in the other (Park et al., Nat Protoc 1:2128–2136, 2006). This feature allows for studying of the effect of specific compounds on selected compartments of neurons.作者: 親屬 時(shí)間: 2025-4-2 11:27 作者: 柳樹；枯黃 時(shí)間: 2025-4-2 15:49
Camil Demetrescu,Bruno Escoffier,Gabriel Moruz,Andrea Ribichinilso depending on degrees of differentiation, activity, and injury. The main histological and ultrastructural features of the different types of cell death in neurons are described and related to the cellular pathways that are specifically activated in any of these types of PCD.
