標(biāo)題: Titlebook: Mathematical Foundations of Computer Science 2011; 36th International S Filip Murlak,Piotr Sankowski Conference proceedings 2011 Springer-V [打印本頁] 作者: 忠誠(chéng) 時(shí)間: 2025-3-21 19:19
書目名稱Mathematical Foundations of Computer Science 2011影響因子(影響力)
書目名稱Mathematical Foundations of Computer Science 2011影響因子(影響力)學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2011網(wǎng)絡(luò)公開度
書目名稱Mathematical Foundations of Computer Science 2011網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2011被引頻次
書目名稱Mathematical Foundations of Computer Science 2011被引頻次學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2011年度引用
書目名稱Mathematical Foundations of Computer Science 2011年度引用學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2011讀者反饋
書目名稱Mathematical Foundations of Computer Science 2011讀者反饋學(xué)科排名
作者: modish 時(shí)間: 2025-3-21 23:24 作者: resilience 時(shí)間: 2025-3-22 01:12
The Bounded Search Tree Algorithm for the , Problem Has Quadratic Smoothed Complexity log?/ loglog? and log?. Using smoothed analysis, we prove that such . instances can be solved efficiently by the .(.??+?. ·..)-time algorithm by Gramm . [13]. In particular, we show that for any given . instance ., the expected running time of this algorithm on a small perturbation of . is ..作者: 鎮(zhèn)痛劑 時(shí)間: 2025-3-22 07:00 作者: 1分開 時(shí)間: 2025-3-22 11:00
Duality and Recognitionof the foundations of computer science, including in modal logic and in domain theory. In this talk I will give a general introduction to Stone duality and explain what this has to do with the connection between regular languages and monoids.作者: dapper 時(shí)間: 2025-3-22 14:58
Faster Coupon Collecting via Replication with Applications in Gossipinge in advance without any knowledge of the random sequence..Our main results are lower and asymptotically matching constructive upper bounds for all three models. We also show that network gossiping (similar in spirit to all-in-all CC) is asymptotically no harder than collecting coupons.作者: podiatrist 時(shí)間: 2025-3-22 20:48 作者: Laconic 時(shí)間: 2025-3-22 21:52
Nearest Neighbor Search in High-Dimensional SpacesFor instance, it forms the basis of a widely used classification method in machine learning: to label a new object, just find a similar but already-labeled object. Nearest neighbor search also serves as a primitive for other computational problems such as closest pair, minimum spanning tree, or variants of clustering.作者: 供過于求 時(shí)間: 2025-3-23 04:48
The Least-Core of Threshold Network Flow Gamesains among its members. However, some games have empty cores, so every distribution is inherently unstable. When the core is empty, one must use a more relaxed notion of stability, such as the least-core. We examine several problems regarding the least-core in general and restricted TNFGs.作者: Ancestor 時(shí)間: 2025-3-23 07:33
Adhesivity Is Not Enough: Local Church-Rosser Revisited be proven in the presence of rules that are merely left-linear, i.e., rules which can merge different parts of a rewritten object. Such rules naturally emerge, e.g., when using graphical encodings for modelling the operational semantics of process calculi.作者: Mutter 時(shí)間: 2025-3-23 10:35
Verifying Proofs in Constant Depthanguages ranging from regular to .-complete. On the other hand, we show by combinatorial methods that even easy regular languages such as Exact-OR do not admit . proof systems. We also present a general construction of . proof systems for regular languages with strongly connected NFA’s.作者: Alienated 時(shí)間: 2025-3-23 16:44
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degrees for planar DAGs of bounded degree. For particular subclasses of planar graphs of bounded degree and for variants thereof, we also provide algorithms that allow for polynomial-time evaluation of the cover polynomials at certain new points by utilizing Valiant’s holographic framework.作者: 矛盾心理 時(shí)間: 2025-3-23 21:47 作者: 收到 時(shí)間: 2025-3-24 01:05 作者: 吞噬 時(shí)間: 2025-3-24 04:37 作者: 清醒 時(shí)間: 2025-3-24 09:31 作者: Trypsin 時(shí)間: 2025-3-24 13:25 作者: 軍械庫 時(shí)間: 2025-3-24 17:56 作者: jocular 時(shí)間: 2025-3-24 21:40
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domainsover . domains of ?. and ?., under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of definition, provided it satisfies a very generous bound on its growth, and that the function admits an analytic extension to the complex plane.作者: Alveoli 時(shí)間: 2025-3-25 01:57 作者: 認(rèn)為 時(shí)間: 2025-3-25 03:45
978-3-642-22992-3Springer-Verlag Berlin Heidelberg 2011作者: V切開 時(shí)間: 2025-3-25 07:41 作者: 名詞 時(shí)間: 2025-3-25 12:08
Invariantization of ListingsWe consider a halting problem for nondeterministic Turing machines and show via invariantization of listings the relationship of its complexity to 作者: RAGE 時(shí)間: 2025-3-25 17:06
Some Variants of the Star Height ProblemGiven a family of recognizable languages ..,…,.. and recognizable languages ..???.., the relative inclusion star height problem means to compute the minimal star height of some rational expression . over ..,…,.. satisfying ..???.(.)???... We show that this problem is of elementary complexity and give an analysis of its complexity.作者: subacute 時(shí)間: 2025-3-25 23:30 作者: Frisky 時(shí)間: 2025-3-26 02:17 作者: 召集 時(shí)間: 2025-3-26 06:33
Duality and Recognitionny practical and theoretical problems in automata theory. It is particularly useful, via the advanced theory initiated by Eilenberg and Reiterman, in separating various complexity classes and, in some cases it leads to decidability of such classes. In joint work with Jean-éric Pin and Serge Grigorie作者: 戲服 時(shí)間: 2025-3-26 11:56 作者: 干旱 時(shí)間: 2025-3-26 15:49
New Proofs in Graph Minors main result of the theory, known as the graph minor structure theorem, approximately describes the structure of graphs which do not contain a fixed graph as a minor. The structure theorem is the central piece of many of the algorithmic applications of graph minor theory. Unfortunately, the statemen作者: 老巫婆 時(shí)間: 2025-3-26 20:46 作者: magnanimity 時(shí)間: 2025-3-26 21:05 作者: hallow 時(shí)間: 2025-3-27 02:57
Quantitative Refinement for Weighted Modal Transition Systemsent specification theories are however qualitative in nature and hence fragile and unsuited for modern software systems. We propose the first specification theory which allows to capture quantitative aspects during the refinement and implementation process.作者: confide 時(shí)間: 2025-3-27 05:22 作者: COMMA 時(shí)間: 2025-3-27 11:47
Verifying Proofs in Constant Depthadmit proof systems in this very restricted model. Formulated alternatively, we ask which languages can be enumerated by . functions. Our results show that the answer to this problem is not determined by the complexity of the language. On the one hand, we construct . proof systems for a variety of l作者: tenuous 時(shí)間: 2025-3-27 13:43 作者: coagulate 時(shí)間: 2025-3-27 18:08 作者: LEER 時(shí)間: 2025-3-28 01:35 作者: addict 時(shí)間: 2025-3-28 02:29 作者: 巡回 時(shí)間: 2025-3-28 09:26 作者: 富饒 時(shí)間: 2025-3-28 11:02
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domainsover . domains of ?. and ?., under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of definition, provided it satisfies a very generous bound on its growth, and that the function admits an analytic extension to the complex plane作者: CUR 時(shí)間: 2025-3-28 14:38 作者: neoplasm 時(shí)間: 2025-3-28 19:55
Petra Berenbrink,Robert Els?sser,Tom Friedetzky,Lars Nagel,Thomas Sauerwaldity to present in a concentrated manner much of the work I have done on the visual cortical areas of cat and monkey. However, the field of visual cortical physi- ology is so active and so diverse that the presentation of only my own work would have given a very incomplete view of visual cortical fun作者: 送秋波 時(shí)間: 2025-3-29 01:05 作者: 附錄 時(shí)間: 2025-3-29 05:41 作者: beta-cells 時(shí)間: 2025-3-29 07:53
Michel Blockelet,Sylvain Schmitzbrain’s functional state. Normal oscillatory activities include slow (0.1–15?Hz, present mainly during slow-wave sleep or anesthesia), fast (20–60?Hz), and ultrafast (100–600?Hz) activities. The fast and ultrafast activities are present in various states of vigilance and frequently coexist with slow作者: 幾何學(xué)家 時(shí)間: 2025-3-29 13:27 作者: 顯示 時(shí)間: 2025-3-29 18:58
Benedikt Bollig,Aiswarya Cyriac,Paul Gastin,Marc Zeitoun if this plasticity is always useful in terms of compensatory function. A patient who had a hemispherectomy during childhood is presented as an example of functionally relevant plasticity in the motor domain. At the time of testing, he was able to voluntarily move the affected arm. Transcranial stim作者: 遣返回國(guó) 時(shí)間: 2025-3-29 23:34
Rémi Bonnet if this plasticity is always useful in terms of compensatory function. A patient who had a hemispherectomy during childhood is presented as an example of functionally relevant plasticity in the motor domain. At the time of testing, he was able to voluntarily move the affected arm. Transcranial stim作者: Exonerate 時(shí)間: 2025-3-30 02:53
Christina Bouchernizes the neurons with which it associates and rejects associations with others. The specific interneuronal relationships that result define the innate neuronal circuits that determine the functioning of this system. The purpose of this volume is to present some approaches to the problem of neuronal作者: 幻想 時(shí)間: 2025-3-30 05:12
Olivier Bournez,Daniel S. Gra?a,Amaury Poulych give rise to the definitive tissues and organs. During the early development of the nervous system, many of its precursor cells emigrate from their sites of origin toward their final locations; there, they associate with similar or other cell types into characteristic patterns and eventually beco作者: chronicle 時(shí)間: 2025-3-30 08:18
Robert Bredereck,André Nichterlein,Rolf Niedermeier,Geevarghese Philipsults from (1) the enormous number of elements involved (in the human CNS, an estimated 10. synapses are formed), (2) the long pathway of certain nerve fibers, and (3) the high selectivity of their synaptic connections, not only between and within groups of neurons, but even with regard to the local作者: 瘋狂 時(shí)間: 2025-3-30 15:56 作者: 消滅 時(shí)間: 2025-3-30 17:16
Markus Bl?ser,Radu Curticapeanindles preserve sleep by contributing to a gating process during which transmission of external auditory stimuli to the cortex is inhibited. In contrast, slow waves induced by external acoustic cues—K-complexes—are associated with enhanced processing of external information at the level of primary a作者: Juvenile 時(shí)間: 2025-3-31 00:25
Michel Blockelet,Sylvain Schmitz to serve important roles, such as the coordination of activity between regions of the nervous system during wakefulness, or the facilitation of memory consolidation during sleep. Slow oscillatory activities—either normal or paroxysmal—are usually associated with a loss of conscious perception. A nu作者: harangue 時(shí)間: 2025-3-31 01:56 作者: 時(shí)間等 時(shí)間: 2025-3-31 08:51 作者: 泥沼 時(shí)間: 2025-3-31 12:27
Rémi Bonnetf this activation contributes to behavioral performance in tactile discrimination tasks, repetitive transcranial magnetic stimulation was delivered to different scalp positions during reading of Braille and embossed Roman letters by blind and sighted subjects. Stimulation of the occipital areas disr作者: Ondines-curse 時(shí)間: 2025-3-31 15:06 作者: 責(zé)怪 時(shí)間: 2025-3-31 20:09 作者: expository 時(shí)間: 2025-3-31 22:55
Robert Bredereck,André Nichterlein,Rolf Niedermeier,Geevarghese Philip73) 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作者: 偏狂癥 時(shí)間: 2025-4-1 04:44
