標(biāo)題: Titlebook: LATIN 2014: Theoretical Informatics; 11th Latin American Alberto Pardo,Alfredo Viola Conference proceedings 2014 Springer-Verlag Berlin He [打印本頁(yè)] 作者: Encomium 時(shí)間: 2025-3-21 17:32
書(shū)目名稱LATIN 2014: Theoretical Informatics影響因子(影響力)
作者: Budget 時(shí)間: 2025-3-21 23:16
https://doi.org/10.1007/978-3-642-54423-1algorithms; approximation algorithms; automata; budget problems; combinatorics; complexity on graphs; comp作者: 膽大 時(shí)間: 2025-3-22 04:07 作者: 碎片 時(shí)間: 2025-3-22 05:26
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs (.?≥?1 and integer) cones have a tight spanning ratio of 1?+?2 sin(./2), where . is 2 ./ (4.?+?2). We also present improved upper bounds on the spanning ratio of the other families of constrained .-graphs.作者: champaign 時(shí)間: 2025-3-22 09:39 作者: 鳴叫 時(shí)間: 2025-3-22 16:56 作者: Debark 時(shí)間: 2025-3-22 18:52
A Characterization of Those Automata That Structurally Generate Finite Groupsgraph is a sink component—generates a finite (semi)group, regardless of the choice of the production functions. Antonenko has proved that this constitutes a characterization in the non-invertible case and asked for the invertible case, which is proved in this paper.作者: Cardioversion 時(shí)間: 2025-3-23 00:44
978-3-642-54422-4Springer-Verlag Berlin Heidelberg 2014作者: thrombus 時(shí)間: 2025-3-23 04:13
LATIN 2014: Theoretical Informatics978-3-642-54423-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Custodian 時(shí)間: 2025-3-23 06:31
erstition, and stigma” (p. 1). Epilepsy was first recorded in Babylonian times, as far back as 2000 bc. The recordings of that time describe many of the different seizure types that we see today and treatments that were essentially spiritual in manner (.). In the 5th century Hippocrates believed tha作者: Terrace 時(shí)間: 2025-3-23 12:40
Volker Diekert,Alexei G. Myasnikov,Armin Wei?erstition, and stigma” (p. 1). Epilepsy was first recorded in Babylonian times, as far back as 2000 bc. The recordings of that time describe many of the different seizure types that we see today and treatments that were essentially spiritual in manner (.). In the 5th century Hippocrates believed tha作者: Mystic 時(shí)間: 2025-3-23 15:22 作者: Invertebrate 時(shí)間: 2025-3-23 18:59 作者: Opponent 時(shí)間: 2025-3-24 00:15 作者: Prophylaxis 時(shí)間: 2025-3-24 02:38 作者: nurture 時(shí)間: 2025-3-24 08:32 作者: Assemble 時(shí)間: 2025-3-24 11:38
Martin Fürer to characterize homogeneous artifacts, such as stone tools, glassware, pottery, coins, bronze or iron items, gold and silver artifacts, as presented in Chap. 46. However, many heritage objects are composite. Here, instead of a bulk average, the local elemental composition should be determined, and 作者: synchronous 時(shí)間: 2025-3-24 17:14
Luis Barba,Prosenjit Bose,Stefan Langerman to characterize homogeneous artifacts, such as stone tools, glassware, pottery, coins, bronze or iron items, gold and silver artifacts, as presented in Chap. 46. However, many heritage objects are composite. Here, instead of a bulk average, the local elemental composition should be determined, and 作者: HAVOC 時(shí)間: 2025-3-24 19:09 作者: hedonic 時(shí)間: 2025-3-25 02:27 作者: Acetaminophen 時(shí)間: 2025-3-25 07:14
Sang Won Bae,Matias Korman,Yoshio Okamoto,Haitao Wangith a practical approach to implementation.Offers innovative.Schools across the United States – as well as much of the world – are experiencing widespread change. Students are more diverse ethnically, academically, and emotionally. More attention is being paid to abuse and neglect, violence and bull作者: 開(kāi)始從未 時(shí)間: 2025-3-25 08:18 作者: 前兆 時(shí)間: 2025-3-25 15:33 作者: anthropologist 時(shí)間: 2025-3-25 15:58
Stephane Durocher,Stefan Felsner,Saeed Mehrabi,Debajyoti Mondalith a practical approach to implementation.Offers innovative.Schools across the United States – as well as much of the world – are experiencing widespread change. Students are more diverse ethnically, academically, and emotionally. More attention is being paid to abuse and neglect, violence and bull作者: 故意釣到白楊 時(shí)間: 2025-3-25 23:51 作者: 擦試不掉 時(shí)間: 2025-3-26 03:09 作者: enlist 時(shí)間: 2025-3-26 06:20 作者: muscle-fibers 時(shí)間: 2025-3-26 09:27
Edward Hermann Haeusler,Mauricio Ayala-Rincónith a practical approach to implementation.Offers innovative.Schools across the United States – as well as much of the world – are experiencing widespread change. Students are more diverse ethnically, academically, and emotionally. More attention is being paid to abuse and neglect, violence and bull作者: coddle 時(shí)間: 2025-3-26 16:03
Maurice Herlihy,Sergio Rajsbaum,Michel Raynal,Julien Stainerlly, and emotionally. More attention is being paid to abuse and neglect, violence and bullying, and the growing inequities that contribute to student dropout. Within this changing landscape, cultural competence is imperative for school-based professionals, both ethically and as mandated by education作者: outer-ear 時(shí)間: 2025-3-26 18:50 作者: 案發(fā)地點(diǎn) 時(shí)間: 2025-3-26 21:25
Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliquehe vertices with at most . colours such that no clique is monochromatic. Défossez proved that the 2-clique-colouring of perfect graphs is a .-complete problem?[J. Graph Theory 62 (2009) 139–156]. We strengthen this result by showing that it is still .-complete for weakly chordal graphs. We then dete作者: Functional 時(shí)間: 2025-3-27 03:30
The Computational Complexity of the Game of Set and Its Theoretical Applicationsi-round variations of this game from the computational complexity point of view and establish interesting connections with other classical computational problems..Specifically, we first show that a natural generalization of the problem of finding a single Set, parameterized by the size of the sought作者: 得罪 時(shí)間: 2025-3-27 07:03
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Lineroblem has attracted significant attention since the sixties, when Wegner conjectured that the corresponding duality gap, i.e., the maximum possible ratio between the maximum independent set and the minimum hitting set, is bounded by a universal constant. In this paper we improve upon recent results作者: Saline 時(shí)間: 2025-3-27 09:59 作者: 彩色 時(shí)間: 2025-3-27 15:47
False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Timeand distributing her weight among these false identities. Analogously to this splitting problem, the beneficial merging problem asks whether a coalition of players can increase their power in a weighted voting game by merging their weights. Aziz et al. [1] analyze the problem of whether merging or s作者: 印第安人 時(shí)間: 2025-3-27 21:35 作者: 預(yù)示 時(shí)間: 2025-3-28 01:40
Optimal Algorithms for Constrained 1-Center Problems Φ. We first study the case when Γ is a set of . points and Φ is either a set of points, a set of segments (lines) or a simple polygon. We propose several algorithms, the first solves the problem when Φ is a set of . segments (or . points) in expected Θ((.?+?.)log.) time, where?.?=? min {., .}. Surp作者: 泥土謙卑 時(shí)間: 2025-3-28 02:23 作者: 來(lái)自于 時(shí)間: 2025-3-28 10:12 作者: 壯麗的去 時(shí)間: 2025-3-28 11:34 作者: 鞭打 時(shí)間: 2025-3-28 16:25 作者: 鐵塔等 時(shí)間: 2025-3-28 22:33 作者: 浮雕寶石 時(shí)間: 2025-3-29 01:16 作者: 窒息 時(shí)間: 2025-3-29 03:53 作者: 粗語(yǔ) 時(shí)間: 2025-3-29 07:36 作者: 悄悄移動(dòng) 時(shí)間: 2025-3-29 13:46 作者: sinoatrial-node 時(shí)間: 2025-3-29 15:54 作者: arousal 時(shí)間: 2025-3-29 22:00
Computing in the Presence of Concurrent Solo Executionsses, either because they crashed or they are too slow. While in wait-free shared-memory models at most one process may run solo in an execution, any number of processes may have to run solo in an asynchronous wait-free message-passing model..This paper is on the computability power of models in whic作者: agenda 時(shí)間: 2025-3-29 23:56
Approximating Vector Scheduling: Almost Matching Upper and Lower Boundse is .. where . (. supresses polylogarithmic terms in .). In particular, the dependence on . is doubly exponential..In this paper we show that a double exponential dependence on . is necessary, and give an improved algorithm with essentially optimum running time. Specifically, we show that:作者: evaculate 時(shí)間: 2025-3-30 05:18 作者: 能夠支付 時(shí)間: 2025-3-30 11:49 作者: BADGE 時(shí)間: 2025-3-30 13:27
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clustersime and expected .(.) space, which considerably improves previous results. Our technique efficiently handles non-standard characteristics of generalized Voronoi diagrams, such as sites of non-constant complexity, sites that are not enclosed in their Voronoi regions, and empty Voronoi regions.作者: 碎石頭 時(shí)間: 2025-3-30 17:33
Smooth Orthogonal Drawings of Planar Graphsraph has an SC.-layout. On the negative side, we demonstrate an infinite family of biconnected 4-planar graphs that require exponential area for an SC.-layout. Finally, we present an infinite family of biconnected 4-planar graphs that do not admit an SC.-layout.作者: Seminar 時(shí)間: 2025-3-30 23:21 作者: 你敢命令 時(shí)間: 2025-3-31 03:31 作者: Relinquish 時(shí)間: 2025-3-31 06:29
Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Clique having size at least 3?[J. Algorithms 45 (2002), 40–54], proving that it is a .-complete problem. We then determine a hierarchy of nested subclasses of perfect graphs with all cliques having size at least 3 whereby each graph class is in a distinct complexity class, namely .-complete, .-complete, and ..作者: instill 時(shí)間: 2025-3-31 10:21 作者: vector 時(shí)間: 2025-3-31 15:53 作者: SLING 時(shí)間: 2025-3-31 17:36
Conference proceedings 2014y, in March/April 2014. The 65 papers presented together with 5 abstracts were carefully reviewed and selected from 192 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on complexity, computational geometry, graph drawing, automata, computabili作者: 釋放 時(shí)間: 2025-4-1 00:01 作者: SOW 時(shí)間: 2025-4-1 04:42
Computing the ,, Geodesic Diameter and Center of a Simple Polygon in Linear Timeis paper we show that any family of .. geodesic balls in any simple polygon has Helly number two, and the .. geodesic center consists of midpoints of shortest paths between diametral pairs. These properties are crucial for our linear-time algorithms, and do not hold for the Euclidean case.作者: gospel 時(shí)間: 2025-4-1 09:07 作者: BIDE 時(shí)間: 2025-4-1 11:54 作者: 材料等 時(shí)間: 2025-4-1 16:35
Helio B. Macêdo Filho,Raphael C. S. Machado,Celina M. H. Figueiredo equations useful for quick calculations or equations in a form useful for proving, doing, or extending calculations found in a reference. The resulting notebook grew to a respectable size, requiring some organizing of the contents. Finally, the size became large enough, and has proven useful enough作者: Exploit 時(shí)間: 2025-4-1 21:25
