標(biāo)題: Titlebook: LATIN 2024: Theoretical Informatics; 16th Latin American José A. Soto,Andreas Wiese Conference proceedings 2024 The Editor(s) (if applicab [打印本頁] 作者: Body-Mass-Index 時(shí)間: 2025-3-21 18:23
書目名稱LATIN 2024: Theoretical Informatics影響因子(影響力)
作者: 引導(dǎo) 時(shí)間: 2025-3-21 21:25
LATIN 2024: Theoretical Informatics978-3-031-55598-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ADORE 時(shí)間: 2025-3-22 00:58 作者: extinct 時(shí)間: 2025-3-22 07:54
https://doi.org/10.1007/978-3-031-55598-5Computer Science; Informatics; Conference Proceedings; Research; Applications作者: propose 時(shí)間: 2025-3-22 09:18 作者: LEVER 時(shí)間: 2025-3-22 13:13
Diego Maldonado,Pedro Montealegre,Martín Ríos-Wilsond discussions of the theoretical, practical and ethical issuThe Handbook of Descriptive Linguistic Fieldwork is the most comprehensive reference on linguistic fieldwork on the market bringing together all the reader needs to carry out successful linguistic fieldwork. Based on the experiences of two 作者: 牙齒 時(shí)間: 2025-3-22 21:01
Gonzalo Navarro,Cristian Urbinaeader needs to carry out successful linguistic fieldwork. Based on the experiences of two veteran linguistic fieldworkers and advice from more than a twenty active fieldwork researchers, this handbook provides an encyclopedic review of current publications on linguistic fieldwork and surveyspast and作者: 精密 時(shí)間: 2025-3-23 00:06
Ankush Acharyya,Vahideh Keikha,Maria Saumell,Rodrigo I. Silveira, we feel, a need to at least recall other line at all? times- times more sedate, slower paced, but nonetheless no lesshighly professional. And to bring them forward for expres- Thus, our dilemma - of growing proportions. The further sion, understanding and use in today‘s professional practice. we m作者: Fabric 時(shí)間: 2025-3-23 02:45
Dhanyamol Antony,L. Sunil Chandran,Ankit Gayen,Shirish Gosavi,Dalu Jacob, we feel, a need to at least recall other line at all? times- times more sedate, slower paced, but nonetheless no lesshighly professional. And to bring them forward for expres- Thus, our dilemma - of growing proportions. The further sion, understanding and use in today‘s professional practice. we m作者: 創(chuàng)造性 時(shí)間: 2025-3-23 07:12
Yuan Qiu,Aaron Williamsnd an enterprising explorer of the boundaries of its province. It wasn‘t always so. Only 15 years ago Thomas Achenbach in publishing the first edition of his book used a recently coined title, Developmental Psychopathology, and began the volume with a provoking first sentence: "This is a book about 作者: cipher 時(shí)間: 2025-3-23 12:46 作者: 兇殘 時(shí)間: 2025-3-23 14:50 作者: 小步走路 時(shí)間: 2025-3-23 19:53
Lorraine A. K. Ayad,Grigorios Loukides,Solon P. Pissis,Hilde Verbeeknd an enterprising explorer of the boundaries of its province. It wasn‘t always so. Only 15 years ago Thomas Achenbach in publishing the first edition of his book used a recently coined title, Developmental Psychopathology, and began the volume with a provoking first sentence: "This is a book about 作者: 粘連 時(shí)間: 2025-3-24 00:47
Andrej Balá?,Travis Gagie,Adrián Goga,Simon Heumos,Gonzalo Navarro,Alessia Petescia,Jouni Sirén970). Several influential initial studies revealed that children and young adults experiencing significant emotional difficulties could be identified by their troubling experiences with peers earlier in childhood (e.g., Roff, 1961). Soon after, follow-forward studies revealed that children who were 作者: 倫理學(xué) 時(shí)間: 2025-3-24 03:54
Amir Abboud,Nick Fischer,Yarin Shechteraits have been regarded as the core of personality and have been shown by research to have important associations with developmental psychopathology. For decades, developmental psychopathology research using temperament has been growing vigorously. We found 1,441 peer-reviewed articles on temperamen作者: Foam-Cells 時(shí)間: 2025-3-24 08:12 作者: follicle 時(shí)間: 2025-3-24 14:44 作者: Heterodoxy 時(shí)間: 2025-3-24 15:56
Sushmita Gupta,Sounak Modak,Saket Saurabh,Sanjay Seetharamanpment of behavioral abnormalities, especially in organisms whose nervous systems remain relatively plastic throughout ontogeny. Researchers and clinical workers in this area are frequently faced with decisions as to whether the phenomenon under investigation or treatment truly represents a pathology作者: Detonate 時(shí)間: 2025-3-24 21:09 作者: 很是迷惑 時(shí)間: 2025-3-25 00:58
Sarita de Berg,Nathan van Beusekom,Max van Mulken,Kevin Verbeek,Jules Wulmspment of behavioral abnormalities, especially in organisms whose nervous systems remain relatively plastic throughout ontogeny. Researchers and clinical workers in this area are frequently faced with decisions as to whether the phenomenon under investigation or treatment truly represents a pathology作者: CANDY 時(shí)間: 2025-3-25 04:22 作者: Junction 時(shí)間: 2025-3-25 09:33
Decoding Tree Decompositions from?Permutationsd denoting by . the family of chordal graphs (triangulations) . such that . and ., the treewidth of a graph . can be defined alternatively as the size of the smallest maximum clique of a graph in ., minus one. In addition, any tree decomposition . of a graph . is also a tree decomposition of .. In t作者: Ganglion 時(shí)間: 2025-3-25 11:42
Enumerating ,-Length Walks in?Directed Graphs with?Constant Delayse constant delay between outputting succinct representations of such walks, after a preprocessing step requiring linear time relative to the size of the graph. We apply these results to the problem of enumerating succinct representations of the strings of a given length from a prefix-closed regular作者: 四指套 時(shí)間: 2025-3-25 19:21 作者: boisterous 時(shí)間: 2025-3-25 21:06 作者: 特征 時(shí)間: 2025-3-26 00:45 作者: Compatriot 時(shí)間: 2025-3-26 07:35
Total Domination, Separated-Cluster, CD-Coloring: Algorithms and?Hardnessf both domination and coloring in it. Let . be an undirected graph. A proper vertex coloring of . is said to be a ., if each color class has a dominating vertex in .. The minimum integer . for which there exists a . of . using . colors is called the . of ., denoted as .. A set . is said to be a ., i作者: jaundiced 時(shí)間: 2025-3-26 08:29
Generating Signed Permutations by?Twisting Two-Sided Ribbonsanges (Steinhaus-Johnson-Trotter algorithm). In plain changes, the .! permutations of [.] are ordered so that successive permutations differ by swapping a pair of adjacent symbols, and the order is often visualized as a weaving pattern on . ropes. Here we model a signed permutation as . ribbons with作者: muffler 時(shí)間: 2025-3-26 13:23
A BWT-Based Algorithm for?Random de Bruijn Sequence Constructionisting algorithms construct a specific dB sequence, or members of a specific class of dB sequences, representing only a tiny fraction of the complete set. The only algorithms capable of generating . dB sequences are based on finding Euler cycles in de Bruijn graphs. Here, we present an algorithm for作者: 出血 時(shí)間: 2025-3-26 19:03 作者: CALL 時(shí)間: 2025-3-26 23:01 作者: flutter 時(shí)間: 2025-3-27 03:31
Wheeler Mapstext .[1...] and an assignment of tags to the characters of . such that we can preprocess a pattern .[1...] and then, given . and ., quickly return all the distinct tags labeling the first characters of the occurrences of .[....] in .. For the applications that most interest us, characters with long作者: 殘酷的地方 時(shí)間: 2025-3-27 08:58
Faster Combinatorial ,-Clique Algorithmse ., where . is the exponent of Boolean matrix multiplication. To date, this is the only technique capable of beating the trivial . bound by a polynomial factor. Due to this technique’s various limitations, much effort has gone into designing “combinatorial” algorithms that improve over exhaustive s作者: 知道 時(shí)間: 2025-3-27 12:26
On Approximate Colored Path Counting of the number, ., of distinct colors assigned to nodes in a query path. We first present data structures that can compute a 2-approximate answer, i.e., a number in ., and achieve three different time/space trade-offs: i) an .(.)-word structure with . query time for any constant ., ii) an .-word str作者: 刪減 時(shí)間: 2025-3-27 17:06
Quick-Sort Style Approximation Algorithms for?Generalizations of?Feedback Vertex Set in?Tournamentsgraph. Lokshtanov et al. [TALG ‘21] gave a factor 2 randomized approximation algorithm for finding a minimum weight FVS in tournaments. We generalize the result by presenting a factor . randomized approximation algorithm for finding a minimum weight FVS in digraphs of independence number .; a genera作者: exclusice 時(shí)間: 2025-3-27 21:23 作者: 豐富 時(shí)間: 2025-3-28 00:54
Competitive Searching over?Terrainst point on the surface of the terrain. The searcher starts on the surface of the terrain and is allowed to fly above the terrain. The goal is to devise a searching strategy that minimizes the ., that is, the worst-case ratio between the distance traveled by the searching strategy and the minimum tra作者: Charlatan 時(shí)間: 2025-3-28 04:10
Computing Largest Minimum Color-Spanning Intervals of?Imprecise Pointsat it can be solved in . time when ., by exploiting several structural properties of candidate solutions, combined with a number of advanced algorithmic techniques. Interestingly, this shows a sharp contrast with the 2-dimensional version of the problem, recently shown to be NP-hard.作者: vertebrate 時(shí)間: 2025-3-28 07:01 作者: Confirm 時(shí)間: 2025-3-28 11:18 作者: PANIC 時(shí)間: 2025-3-28 17:04
Quick-Sort Style Approximation Algorithms for?Generalizations of?Feedback Vertex Set in?Tournamentsthm for finding a minimum weight Subset FVS in tournaments: given a vertex subset . in addition to the graph, find a subset of vertices that hits all cycles containing at least one vertex in .. Note that FVS in tournaments is a special case of Subset FVS in tournaments in which ..作者: foodstuff 時(shí)間: 2025-3-28 22:45 作者: exhilaration 時(shí)間: 2025-3-29 02:27 作者: 微生物 時(shí)間: 2025-3-29 06:05
Enumerating ,-Length Walks in?Directed Graphs with?Constant Delaythe graph. We apply these results to the problem of enumerating succinct representations of the strings of a given length from a prefix-closed regular language (languages accepted by a finite automaton which has final states only).作者: 貧困 時(shí)間: 2025-3-29 07:57
Space-Efficient Conversions from?SLPsthin . space and in . time, where . is the substring complexity measure of .. Finally, we show how to build the LZ parse of . from such an LCG within . space and in time .. All our results hold with high probability.作者: GOUGE 時(shí)間: 2025-3-29 13:25 作者: 換話題 時(shí)間: 2025-3-29 18:43 作者: Provenance 時(shí)間: 2025-3-29 19:48
0302-9743 n topical sections as follows:Part I:?Algorithms and Data Structures; Approximation and Online Algorithms; Complexity Theory;?.Part II: Combinatorics and Graph Theory; Parameterized Algorithms; Automata Theory and Formal Languages; and Game Theory and Fairness.?.978-3-031-55597-8978-3-031-55598-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 單調(diào)女 時(shí)間: 2025-3-30 02:40
Conference proceedings 2024hile, in March 2024.?.The 44 papers presented in this volume were carefully reviewed and selected from 93 submissions. They were organized in topical sections as follows:Part I:?Algorithms and Data Structures; Approximation and Online Algorithms; Complexity Theory;?.Part II: Combinatorics and Graph 作者: hermitage 時(shí)間: 2025-3-30 07:26
Diego Maldonado,Pedro Montealegre,Martín Ríos-Wilsonammatical information from discourse and conversational data as well as the relationship between questionnaire-based elicitation, text-based elicitation, and philology, and the need for combinations of these me978-94-007-9218-0978-90-481-9026-3作者: 傻 時(shí)間: 2025-3-30 09:39 作者: 奇怪 時(shí)間: 2025-3-30 15:58 作者: 手段 時(shí)間: 2025-3-30 18:37
The Hardness of?Local Certification of?Finite-State Dynamics First, we study the problem . on arbitrary graphs and show that every PLS has certificates of size . (up to logarithmic factors). Then, we turn to the restriction of the problem on graphs of maximum degree .. Roughly, we show that the problem admits a PLS with certificates of size ., while every PL作者: Commonwealth 時(shí)間: 2025-3-30 22:57
Total Domination, Separated-Cluster, CD-Coloring: Algorithms and?Hardnessnd .. For any graph ., we have . and .. First, we explore the connection of . problem to the well-known problem .. Note that . is known to be NP-Complete for . 3.. We generalize this result by proving that both the problems . and . are NP-Complete, and do not admit any subexponential-time algorithms作者: 斜坡 時(shí)間: 2025-3-31 02:21
A BWT-Based Algorithm for?Random de Bruijn Sequence Constructionnd on a laptop computer for orders up to 23, including outputting the sequence. It can be straightforwardly extended to any constant-size alphabet. To the best of our knowledge, this is the first practical algorithm for generating random dB sequences which is capable of producing . dB sequences. Apa作者: 煞費(fèi)苦心 時(shí)間: 2025-3-31 08:57
Sparse Suffix and?LCP Array: Simple, Direct, Small, and?Fastmber of suffixes with an LCP value greater than . is in ., matching the time of optimal yet much more complicated algorithms [Gawrychowski and Kociumaka, SODA 2017; Birenzwige et al., SODA 2020]; and . in the sense that they can be implemented using . . machine words. We also show that our second al作者: Canopy 時(shí)間: 2025-3-31 10:13
Faster Combinatorial ,-Clique Algorithmsve the state-of-the-art (even of non-combinatorial algorithms) for generalizations of the .-Clique problem. In particular, we give the first . algorithm for .-clique in hypergraphs and an . algorithm for listing . triangles in a graph.作者: 倔強(qiáng)不能 時(shí)間: 2025-3-31 15:41
On Approximate Colored Path Countingn ., where . is an arbitrary constant in (0,?1); our solution not only has faster query time but also always returns a .-approximation. When designing .-approximate solutions, our techniques also yield an .(.)-word structure that can answer a colored type-2 path counting query in . time; this query 作者: 誘騙 時(shí)間: 2025-3-31 18:21 作者: 刺耳 時(shí)間: 2025-3-31 21:51
Gonzalo Navarro,Cristian Urbinae subject such as the collection, representation, management, and methods of extracting grammatical information from discourse and conversational data as well as the relationship between questionnaire-based elicitation, text-based elicitation, and philology, and the need for combinations of these me作者: 廢除 時(shí)間: 2025-4-1 01:56
Ankush Acharyya,Vahideh Keikha,Maria Saumell,Rodrigo I. Silveira expression of those things obsolete, outmoded, archaic or snail-like slow. It is times, and the filling of the voids left by time- from then . til about being open, factual, and advisory about moving for- now. Techniques may change, but understanding, direction, ward, in new ways, but maintaining a作者: exacerbate 時(shí)間: 2025-4-1 08:28
Dhanyamol Antony,L. Sunil Chandran,Ankit Gayen,Shirish Gosavi,Dalu Jacob expression of those things obsolete, outmoded, archaic or snail-like slow. It is times, and the filling of the voids left by time- from then . til about being open, factual, and advisory about moving for- now. Techniques may change, but understanding, direction, ward, in new ways, but maintaining a
