標題: Titlebook: Mathematical Foundations of Computer Science 2002; 27th International S Krzysztof Diks,Wojciech Rytter Conference proceedings 2002 Springer [打印本頁] 作者: 鳥場 時間: 2025-3-21 17:32
書目名稱Mathematical Foundations of Computer Science 2002影響因子(影響力)
書目名稱Mathematical Foundations of Computer Science 2002影響因子(影響力)學科排名
書目名稱Mathematical Foundations of Computer Science 2002網(wǎng)絡公開度
書目名稱Mathematical Foundations of Computer Science 2002網(wǎng)絡公開度學科排名
書目名稱Mathematical Foundations of Computer Science 2002被引頻次
書目名稱Mathematical Foundations of Computer Science 2002被引頻次學科排名
書目名稱Mathematical Foundations of Computer Science 2002年度引用
書目名稱Mathematical Foundations of Computer Science 2002年度引用學科排名
書目名稱Mathematical Foundations of Computer Science 2002讀者反饋
書目名稱Mathematical Foundations of Computer Science 2002讀者反饋學科排名
作者: 排他 時間: 2025-3-21 21:43
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Appli exponential complexity in the ω-nondeterministic well-structured g.d.-BP1 model for ..This answers an open question from Brosenne, Homeister, and Waack [.], whether the nondeterministic BP1 model is in fact more powerful than the well-structured graph-driven variant.作者: 音的強弱 時間: 2025-3-22 00:53
Matroid Intersections, Polymatroid Inequalities, and Related Problemsor which .(.) ≥ ., and let . = |.|. We show that α ≤ max.,β(log.)/., where . = .(.,β) is the unique positive root of the equation 2.(../logβ - 1) = 1. In particular, our bound implies that α ≤ (.β).. We also give examples of polymatroid functions with arbitrarily large ..,α and β for which α = β(.-.1))log ..作者: Stress-Fracture 時間: 2025-3-22 04:39 作者: 博識 時間: 2025-3-22 09:28 作者: 愛哭 時間: 2025-3-22 15:23
Two-Way Finite State Transducers with Nested Pebblese ranges of the .-pebble transducers form a hierarchy with respect to ., their finiteness problem is decidable, and they can be generated by compositions of . macro tree transducers. Related results hold in the nondeterministic case.作者: 爵士樂 時間: 2025-3-22 19:54 作者: 打火石 時間: 2025-3-23 00:10 作者: endocardium 時間: 2025-3-23 02:45
0302-9743 ics, combinatorial optimization, graph theory, algorithms, and complexity to programming theory, formal methods, and mathematical logic.978-3-540-44040-6978-3-540-45687-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 刀鋒 時間: 2025-3-23 06:44
On Infinite Terms Having a Decidable Monadic Theoryfined by Damm, and recently considered by Courcelle and Knapik: the families of terms obtained by iterating applications of first order substitutions to the set of regular terms. Finally, using second order substitutions yields the same terms.作者: 娘娘腔 時間: 2025-3-23 13:23
0302-9743 ons of Computer Science, MFCS 2002, held in Warsaw, Poland in August 2002..The 48 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 108 submissions. All relevant aspects of theoretical computer science are addressed, ranging from discrete mathemat作者: INERT 時間: 2025-3-23 15:54 作者: 籠子 時間: 2025-3-23 18:45
Krzysztof Diks,Wojciech RytterIncludes supplementary material: 作者: 使人煩燥 時間: 2025-3-24 00:09
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626136.jpg作者: prostate-gland 時間: 2025-3-24 05:20 作者: 和平主義 時間: 2025-3-24 10:04 作者: 商品 時間: 2025-3-24 13:07
Approximability of the Minimum Bisection Problem: An Algorithmic ChallengeWe survey some recent results on the complexity of computing approximate solutions for instances of the . problem and formulate some very intriguing and still open questions about the approximability status of that problem.作者: insert 時間: 2025-3-24 17:18
Low Stretch Spanning TreesThe paper provides a brief review of problems and results concerning low stretch and low communication spanning trees for graphs.作者: Innocence 時間: 2025-3-24 20:24 作者: Radiculopathy 時間: 2025-3-25 02:24 作者: Pantry 時間: 2025-3-25 05:49 作者: 控訴 時間: 2025-3-25 09:53
Packing Edges in Random Regular Graphsching in the classical sense). We consider the problem of approximating the solution to the maximum .-separated matching problem in random .-regular graphs for each fixed integer . and each fixed . ≥ 3. We prove both constructive lower bounds and combinatorial upper bounds on the size of the optimal solutions.作者: 沙草紙 時間: 2025-3-25 15:04
Accessibility in Automata on Scattered Linear Orderingsite words introduced by Büchi. In this paper, we show that if only words indexed by scattered linear orderings are considered, the accessibility and the emptiness in these automata can be checked in time .. where . and . are the number of states and the number of transitions. This solves the problem for automata on transfinite words.作者: Minatory 時間: 2025-3-25 17:59 作者: abreast 時間: 2025-3-25 19:59
Mathematical Foundations of Computer Science 2002978-3-540-45687-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CHURL 時間: 2025-3-26 03:08 作者: 狂亂 時間: 2025-3-26 06:22
Michel Bidoit,Donald Sannella,Andrzej Tarleckiod and organization of neuromorphic architecture.Presents a This book focuses on neuromorphic computing principles and organization and how to build fault-tolerant scalable hardware for large and medium scale spiking neural networks with learning capabilities. In addition, the book describes in a co作者: Lipohypertrophy 時間: 2025-3-26 11:22
Alan Gibbons,Paul Santod and organization of neuromorphic architecture.Presents a This book focuses on neuromorphic computing principles and organization and how to build fault-tolerant scalable hardware for large and medium scale spiking neural networks with learning capabilities. In addition, the book describes in a co作者: avulsion 時間: 2025-3-26 15:47 作者: Heresy 時間: 2025-3-26 18:45 作者: 口味 時間: 2025-3-26 21:16 作者: 消耗 時間: 2025-3-27 02:08
Maria I. Andreou,Dimitris A. Fotakis,Sotiris E. Nikoletseas,Vicky G. Papadopoulou,Paul G. Spirakisance. In those novel scenarios, radars must perform well in dense scenes with a large number of neighboring scatterers. Central to radar performance is the detection algorithm used to separate targets from the background noise and clutter. Traditionally, most radar systems use conventional constant 作者: Entirety 時間: 2025-3-27 05:16 作者: 老人病學 時間: 2025-3-27 10:53 作者: 遺產(chǎn) 時間: 2025-3-27 13:38 作者: 北京人起源 時間: 2025-3-27 20:56 作者: 讓步 時間: 2025-3-27 23:44
Endre Boros,Khaled Elbassioni,Vladimir Gurvich,Leonid Khachiyan in order to process it with efficient digital computers. Nature, however, could not wait for the development of computer science and creatures developed various strategies to interact with their environment. These interactions consist of sensing the environment and producing an action on it under t作者: monochromatic 時間: 2025-3-28 02:18
Olivier Cartonrphic. expresses relations tocomputational models found in biological neural systems, which areused as inspiration for building large electronic .systems insilicon.. By adequate .engineering., these silicon systems aremade useful to mankind. ..Neuromorphic Systems Engineering: Neural Networks in Sil作者: Throttle 時間: 2025-3-28 07:01 作者: 失望昨天 時間: 2025-3-28 12:17
Didier Caucal,Teodor Knapikings. It measures lean soft tissue (LST), fat mass, and bone mineral content and is currently a surrogate method to assess muscle mass. As DXA does not directly measures skeletal muscle, appendicular LST (ALST) is used for its estimation, as 75% of whole-body skeletal muscle is located in the arms a作者: 難理解 時間: 2025-3-28 17:50 作者: 歸功于 時間: 2025-3-28 19:47 作者: 乳汁 時間: 2025-3-28 23:44 作者: Blazon 時間: 2025-3-29 05:41
Todd Ebert,Wolfgang Merkleifying causal mechanisms of disease, diagnostic testing, determining prognosis, and testing new treatments. The goal of an epidemiological study is valid measurement. To understand this goal, it is necessary to understand what it is that is being measured and what is meant by the term validity. The 作者: spinal-stenosis 時間: 2025-3-29 09:57
Global Development via Local Observational Construction Stepsements is explored. Observational interpretation of specifications and refinements add expressive power and flexibility while bringing in some subtle problems. The results are instantiated in the context of . architectural specifications.作者: Fortuitous 時間: 2025-3-29 13:44
Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Mire hours of electronic computation. The search for a satisfactory proof continues and, in this spirit, we explore two approaches to .. In the first, we prove that a satisfactory proof exists if the . between the two trees of the problem instance always satisfies a specific condition embodied in our作者: dithiolethione 時間: 2025-3-29 18:58
On Radiocoloring Hierarchically Specified Planar Graphs: ( mathcal{P}mathcal{S}mathcal{P}mathcal{A}mineering. A well known hierarchical specification model, considered in this work, is that of Lengauer [., .] referred to as .. In this paper we discuss a restriction on the L-specifications resulting to graphs which we call Well-Separated .. This class is characterized by a polynomial time (to the s作者: Asperity 時間: 2025-3-29 20:56 作者: AVANT 時間: 2025-3-30 00:21
Fast Algorithms with Algebraic Monge Propertiescantly easier to solve. The more general algebraic assignment and transportation problems are similarly easier to solve given cost arrays possessing the corresponding algebraic Monge property. We show that Monge-array results for two sum-of-edge-costs shortest-path problems can likewise be extended 作者: diskitis 時間: 2025-3-30 05:41 作者: custody 時間: 2025-3-30 10:10 作者: 下級 時間: 2025-3-30 15:08 作者: 加劇 時間: 2025-3-30 18:53
Accessibility in Automata on Scattered Linear Orderingsite words introduced by Büchi. In this paper, we show that if only words indexed by scattered linear orderings are considered, the accessibility and the emptiness in these automata can be checked in time .. where . and . are the number of states and the number of transitions. This solves the problem作者: abreast 時間: 2025-3-30 22:45 作者: 被告 時間: 2025-3-31 01:53 作者: 惡臭 時間: 2025-3-31 07:35
Coloring ,-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programmingf this paper is to present an algorithm for finding a large independent set in a semirandom graph in polynomial expected time, thereby extending the work of Feige and Kilian [.]. In order to preprocess the input graph, the algorithm makes use of SDP-based techniques. The analysis of the algorithm sh作者: angina-pectoris 時間: 2025-3-31 12:51
On Word Equations in One Variablee. This is the best result known and for the equations that feature #. < ./log. it yields time complexity of .(.) which is optimal. Additionally, we prove that the set of solutions of one-variable word equations is either of the form . where . is a set of .(log.) words or of the form . ∪ (.).. where作者: 組成 時間: 2025-3-31 14:20 作者: 帶子 時間: 2025-3-31 18:29
Two-Way Finite State Transducers with Nested Pebblesnsductions computed by such pebble transducers are closed under composition, and they can be realized by the composition of one-pebble transducers. The ranges of the .-pebble transducers form a hierarchy with respect to ., their finiteness problem is decidable, and they can be generated by compositi作者: FECT 時間: 2025-3-31 23:04 作者: 顯而易見 時間: 2025-4-1 05:46 作者: 吹牛需要藝術 時間: 2025-4-1 09:29
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits, our main result asserts that for any computable function . that goes non-ascendingly to zero, any rec-random set is i.o. truth-table-autoreducible such that the set of guessed bits has density bounded from below by .(.).
