標(biāo)題: Titlebook: Mathematical Foundations of Computer Science 2012; 37th International S Branislav Rovan,Vladimiro Sassone,Peter Widmayer Conference proceed [打印本頁] 作者: Limbic-System 時(shí)間: 2025-3-21 19:50
書目名稱Mathematical Foundations of Computer Science 2012影響因子(影響力)
書目名稱Mathematical Foundations of Computer Science 2012影響因子(影響力)學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2012網(wǎng)絡(luò)公開度
書目名稱Mathematical Foundations of Computer Science 2012網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2012被引頻次
書目名稱Mathematical Foundations of Computer Science 2012被引頻次學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2012年度引用
書目名稱Mathematical Foundations of Computer Science 2012年度引用學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2012讀者反饋
書目名稱Mathematical Foundations of Computer Science 2012讀者反饋學(xué)科排名
作者: 燒瓶 時(shí)間: 2025-3-21 22:36 作者: 剛開始 時(shí)間: 2025-3-22 02:04 作者: 營養(yǎng) 時(shí)間: 2025-3-22 08:34 作者: 尊敬 時(shí)間: 2025-3-22 09:13
Georg Gottlob,Marco Manna,Michael Morak,Andreas Pieris73) as well as studies on synapse formation . (Rees and Bunge, 1974) clearly indicate that the specificity of synaptic connections is not absolute and that it is strictly effective only during a certain period of embryonic development. This suggests that the constellation of neurons—i.e., the availa作者: sulcus 時(shí)間: 2025-3-22 13:00
Christian Komusiewicz,Rolf Niedermeiere when considering that epilepsy is often diagnosed in hypophosphatasia. Here we overview our results on the identification of TNAP in the primate cerebral cortex: TNAP exhibits a noticeably high activity in the synapses and nodes of Ranvier, is specifically present in layer 4 of the sensory cortice作者: 糾纏,纏繞 時(shí)間: 2025-3-22 20:41
Antonino Salibrauple immunohistochemistry with four canonical IPL markers (tyrosine hydroxylase, choline acetyltransferase, calretinin, protein kinase C α). Diabetes results in diminishing retinal TNAP activity before changes in canonical markers could be observed in a rat model. The presence of TNAP activity at cr作者: Fermentation 時(shí)間: 2025-3-22 21:40
Nicole SchweikardtP clearly influences extracellular and intracellular metabolism of vitamin B-6 in brain, particularly during developmental stages. While effects on GABA metabolism appear to be the major contributor to seizures, multiple other intra- and extra-cellular metabolic systems may be affected directly and/作者: 灌輸 時(shí)間: 2025-3-23 01:28 作者: 旁觀者 時(shí)間: 2025-3-23 06:37
Igor Walukiewiczuple immunohistochemistry with four canonical IPL markers (tyrosine hydroxylase, choline acetyltransferase, calretinin, protein kinase C α). Diabetes results in diminishing retinal TNAP activity before changes in canonical markers could be observed in a rat model. The presence of TNAP activity at cr作者: ORBIT 時(shí)間: 2025-3-23 13:25
Gerhard J. Woegingergion. For example, neurons in cerebral cortex, hippocampus, striatum and thalamus are more sensitive to ischemia than those in other areas of the CNS (.). In hippocampus, most CA1 pyramidal neurons die after transient global ischemia while CA3 neurons and dentate granule cells survive (.; .; .). In 作者: Hearten 時(shí)間: 2025-3-23 17:42 作者: 要塞 時(shí)間: 2025-3-23 19:34 作者: 冷淡一切 時(shí)間: 2025-3-23 23:54 作者: 不幸的人 時(shí)間: 2025-3-24 06:11 作者: N斯巴達(dá)人 時(shí)間: 2025-3-24 08:51 作者: 謙虛的人 時(shí)間: 2025-3-24 11:56
Vikraman Arvind,Partha Mukhopadhyay,Prajakta Nimbhorkar,Yadu Vasudevche Repr?sentationen von Silben wie auch phonologische Relationen zwischen Silben und W?rtern k?nnen in diesem Ansatz in Form von S-Pointer-Netzwerken modelliert werden. Diese S-Pointer-Netzwerke k?nnen Teil der neuronalen Realisierung des Langzeitged?chtnisses angesehen werden.作者: eczema 時(shí)間: 2025-3-24 15:19
Eugene Asarin,Nicolas Basset,Aldric Degorre,Dominique Perrinche Repr?sentationen von Silben wie auch phonologische Relationen zwischen Silben und W?rtern k?nnen in diesem Ansatz in Form von S-Pointer-Netzwerken modelliert werden. Diese S-Pointer-Netzwerke k?nnen Teil der neuronalen Realisierung des Langzeitged?chtnisses angesehen werden.作者: 多骨 時(shí)間: 2025-3-24 21:57 作者: 返老還童 時(shí)間: 2025-3-25 02:29 作者: 證明無罪 時(shí)間: 2025-3-25 03:53 作者: cortisol 時(shí)間: 2025-3-25 10:33 作者: Hemodialysis 時(shí)間: 2025-3-25 11:41
Scott Is Always Simple,In this paper we give an outline of recent algebraic results concerning theories and models of the untyped lambda calculus.作者: musicologist 時(shí)間: 2025-3-25 16:09 作者: 委派 時(shí)間: 2025-3-25 22:04 作者: CESS 時(shí)間: 2025-3-26 00:59
https://doi.org/10.1007/978-3-642-32589-2constraint satisfaction; games; model checking; planar graphs; polinomial representations; algorithm anal作者: 不發(fā)音 時(shí)間: 2025-3-26 05:26 作者: Bother 時(shí)間: 2025-3-26 09:53
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626146.jpg作者: 甜食 時(shí)間: 2025-3-26 12:52 作者: characteristic 時(shí)間: 2025-3-26 17:55
Drawing Planar Graphs on Points Inside a Polygon,given polygon. We give a method that shows that for an .-vertex graph and a .-sided polygon, Θ(..) bends are always sufficient. We also give an example of a graph where Θ(..) bends are necessary for such a drawing.作者: Enervate 時(shí)間: 2025-3-26 20:58 作者: Alpha-Cells 時(shí)間: 2025-3-27 03:44 作者: 憤怒事實(shí) 時(shí)間: 2025-3-27 06:30
0302-9743 ternational Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory作者: Occupation 時(shí)間: 2025-3-27 13:21
Unordered Constraint Satisfaction Games,functions or threshold functions with a threshold that is small compared to the arity of the constraints. Also, we prove that the problem of determining if Player I can satisfy all constraints is PSPACE-complete even in this unordered setting, and when the constraints are disjunctions of at most 6 literals (an unordered-game analogue of 6-QBF).作者: hematuria 時(shí)間: 2025-3-27 14:12
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounanar graphs whose maximum vertex degree is bounded by a constant, where it is known that the problem is NP-hard even for outerplanar graphs of unbounded degree. Although the algorithm repeatedly modifies input graphs, it is shown that the number of relevant subproblems is polynomially bounded and thus the algorithm works in polynomial time.作者: 脫落 時(shí)間: 2025-3-27 20:31 作者: 不成比例 時(shí)間: 2025-3-28 01:39 作者: Ornament 時(shí)間: 2025-3-28 02:12 作者: 軌道 時(shí)間: 2025-3-28 10:01
0302-9743 r-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.978-3-642-32588-5978-3-642-32589-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 睨視 時(shí)間: 2025-3-28 11:15 作者: geometrician 時(shí)間: 2025-3-28 18:06 作者: 包租車船 時(shí)間: 2025-3-28 20:19
New Races in Parameterized Algorithmics, further aspects of efficiency that deserve attention. We discuss several of these aspects and particularly focus on the search for “stronger parameterizations” in developing fixed-parameter algorithms.作者: 抑制 時(shí)間: 2025-3-29 01:55 作者: synovitis 時(shí)間: 2025-3-29 05:32
Simple Models for Recursive Schemes,ough of as a syntactic simplification of a fragment of the lambda calculus, we propose to go back to lambda calculus to study schemes. In particular, for the model checking problem we propose to use standard finitary models for the simply-typed lambda calculus.作者: gout109 時(shí)間: 2025-3-29 09:24
Computation of Least Fixed Points,f fixed points for general (nonlinear) algebraic functions, with the 3-player Nash equilibrium problem as a prototypical example, and PPAD for the computation of fixed points for piecewise linear functions, with the 2-player Nash equilibrium problem as a prototypical example.作者: 串通 時(shí)間: 2025-3-29 14:32
Reductions to the Set of Random Strings: The Resource-Bounded Case,of time-.-bounded Kolmogorov-random strings (for all large enough time bounds .), then . is in P/poly, and that if in addition such a reduction exists for any universal Turing machine one uses in the definition of Kolmogorov complexity, then . is in PSPACE.作者: 里程碑 時(shí)間: 2025-3-29 16:33 作者: Cursory 時(shí)間: 2025-3-29 20:35
Conference proceedings 2012es, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.作者: 按時(shí)間順序 時(shí)間: 2025-3-30 01:50 作者: anthesis 時(shí)間: 2025-3-30 06:46 作者: intoxicate 時(shí)間: 2025-3-30 09:45 作者: 拍翅 時(shí)間: 2025-3-30 13:31 作者: 牛的細(xì)微差別 時(shí)間: 2025-3-30 16:44 作者: Memorial 時(shí)間: 2025-3-30 21:15
Esko Ukkonenlar substrates inorganic pyrophosphates (PPi), pyridoxal-5′-phosphate (PLP), phosphoethanolamine (PEA) and nucleotides, and probably other substrates not yet identified. During the last 15 years the role of TNAP in mineralization, and to a less degree in brain, has been investigated, providing hypot作者: 賞錢 時(shí)間: 2025-3-31 01:21
Igor Walukiewiczwell as diseases of the nervous system. Exploration of TNAP in well characterized neural circuits such as the retina, might significantly advance our understanding regarding neural TNAP’s roles. This chapter reviews the scarce literature as well as our findings on retinal TNAP. We found that retinal作者: CANE 時(shí)間: 2025-3-31 05:51
Gerhard J. Woegingertic plasticity in adulthood is associated with learning and memory. Accumulating evidence indicates that synaptic plasticity also exists in neurological disorders such as epilepsy and stroke. The alterations of synaptic transmission during and after the insult might be involved in the process of neu作者: CARK 時(shí)間: 2025-3-31 09:46 作者: 放肆的我 時(shí)間: 2025-3-31 16:05 作者: 勉強(qiáng) 時(shí)間: 2025-3-31 18:31 作者: Genome 時(shí)間: 2025-4-1 00:34
