標(biāo)題: Titlebook: New Frontiers in Artificial Intelligence; JSAI-isAI Internatio Maki Sakamoto,Naoaki Okazaki,Ken Satoh Conference proceedings 2020 The Edito [打印本頁(yè)] 作者: 自由 時(shí)間: 2025-3-21 19:56
書(shū)目名稱(chēng)New Frontiers in Artificial Intelligence影響因子(影響力)
書(shū)目名稱(chēng)New Frontiers in Artificial Intelligence影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)New Frontiers in Artificial Intelligence網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)New Frontiers in Artificial Intelligence網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)New Frontiers in Artificial Intelligence被引頻次
書(shū)目名稱(chēng)New Frontiers in Artificial Intelligence被引頻次學(xué)科排名
書(shū)目名稱(chēng)New Frontiers in Artificial Intelligence年度引用
書(shū)目名稱(chēng)New Frontiers in Artificial Intelligence年度引用學(xué)科排名
書(shū)目名稱(chēng)New Frontiers in Artificial Intelligence讀者反饋
書(shū)目名稱(chēng)New Frontiers in Artificial Intelligence讀者反饋學(xué)科排名
作者: 享樂(lè)主義者 時(shí)間: 2025-3-21 20:14
ing controversy in online discussions is a challenging task, but essential to stop these unhealthy behaviours..In this work, we develop a general pipeline to quantify controversy on social media through content analysis, and we widely test it on Twitter..Our approach can be outlined in four phases: 作者: BOOST 時(shí)間: 2025-3-22 01:50
Takahiro Komamizu,Kazuya Fujioka,Yasuhiro Ogawa,Katsuhiko Toyamaing controversy in online discussions is a challenging task, but essential to stop these unhealthy behaviours..In this work, we develop a general pipeline to quantify controversy on social media through content analysis, and we widely test it on Twitter..Our approach can be outlined in four phases: 作者: BUMP 時(shí)間: 2025-3-22 07:04
Jieh-Sheng Lee,Jieh Hsianging controversy in online discussions is a challenging task, but essential to stop these unhealthy behaviours..In this work, we develop a general pipeline to quantify controversy on social media through content analysis, and we widely test it on Twitter..Our approach can be outlined in four phases: 作者: eustachian-tube 時(shí)間: 2025-3-22 10:54
Juliano Rabelo,Mi-Young Kim,Randy Goebel,Masaharu Yoshioka,Yoshinobu Kano,Ken Satohe compressed text in bytes, . is the size of the alphabet, and . is a user specified parameter. The method uses a variable size super-alphabet, with an average size of . symbols, where . is the entropy of the text. Each super-symbol is processed in .(1) time. The algorithm uses .(2.) space, and .(.2作者: affect 時(shí)間: 2025-3-22 16:17 作者: 魯莽 時(shí)間: 2025-3-22 19:39 作者: abreast 時(shí)間: 2025-3-23 00:55 作者: 蕁麻 時(shí)間: 2025-3-23 02:53
Yoshihiro Nishi,Aiko Suge,Hiroshi Takahashihe suffix array (SA) and provides an implicit representation of the topology of an underlying suffix tree. The LCP array of a string of length . can be represented as an array of length . words, or, in the presence of the SA, as a bit vector of 2. bits plus asymptotically negligible support data str作者: instill 時(shí)間: 2025-3-23 09:04
Hirotaka Yanada,Setsuya Kurahashi to return documents in another. Many CLIR techniques attempt to translate the user’s query to the language of the target documents using translation dictionaries. However, these techniques have limitations in terms of lexical coverage of the dictionary adopted. For some applications, the dictionari作者: DIKE 時(shí)間: 2025-3-23 10:10
test Common Supersequence (WSCS) problem, introduced by Amir et al. [SPIRE 2011], that is, the SCS problem on weighted strings. In the WSCS problem, we are given two weighted strings . and . and a threshold . on probability, and we are asked to compute the shortest (standard) string . such that both作者: 不透氣 時(shí)間: 2025-3-23 16:32 作者: chemoprevention 時(shí)間: 2025-3-23 18:21
Paul M. Pietroskitest Common Supersequence (WSCS) problem, introduced by Amir et al. [SPIRE 2011], that is, the SCS problem on weighted strings. In the WSCS problem, we are given two weighted strings . and . and a threshold . on probability, and we are asked to compute the shortest (standard) string . such that both作者: 誓言 時(shí)間: 2025-3-23 23:54
Jan K?pping,Thomas Ede Zimmermannrom learning-to-rank models. The method takes two steps - estimating click propensities and using them to train unbiased models. Most common methods proposed in the literature for estimating propensities involve some degree of intervention in the live search engine. An alternative approach proposed 作者: Aesthete 時(shí)間: 2025-3-24 05:10
Alastair Butlernode paths). A . is a regular language admitting an accepting Wheeler automaton. Wheeler languages admit efficient and elegant solutions to hard problems such as automata compression and regular expression matching, therefore deciding whether a regular language is Wheeler is relevant in applications作者: Infuriate 時(shí)間: 2025-3-24 10:09 作者: 憎惡 時(shí)間: 2025-3-24 13:15
Oleg Kiselyov,Yuya Hoshinoon of this distance, which is simply the minimum number of character insertions, deletions and substitutions needed to transform one string to the other, presents remarkable algorithmic challenges..This talk will examine the task of approximating the basic edit distance between two strings, starting作者: Bricklayer 時(shí)間: 2025-3-24 16:57 作者: 清醒 時(shí)間: 2025-3-24 20:52 作者: 掃興 時(shí)間: 2025-3-25 01:23
PatentTransformer-1.5: Measuring Patent Claim Generation by Span Relevancyalize “augmented inventing” for inventors by leveraging new Deep Learning techniques. We envision the possibility of building an “auto-complete” function for inventors to conceive better inventions in the era of artificial intelligence. In order to generate patent claims with reasonable quality, a f作者: Chromatic 時(shí)間: 2025-3-25 05:37 作者: 盡責(zé) 時(shí)間: 2025-3-25 08:13 作者: Glaci冰 時(shí)間: 2025-3-25 12:13
Automatic Extraction of Legal Norms: Evaluation of Natural Language Processing Toolserate this process are in high demand. In this paper, we address two major questions related to this problem: (i) what are the challenges in formalising legal documents into a machine understandable formalism? (ii) to what extent can the data-driven state-of-the-art approaches developed in the Natur作者: 責(zé)問(wèn) 時(shí)間: 2025-3-25 17:00
Deep Learning for Multi-factor Models in Regional and Global Stock Marketspoint of the cross-sectional prediction with machine learning techniques, there are no examples that verify its profitability in regional and global stock markets. This paper implements deep learning for multi-factor models to predict stock returns in the cross-section in these stock markets and inv作者: 隱藏 時(shí)間: 2025-3-25 20:43
News Articles Evaluation Analysis in Automotive Industry Using GPT-2 and Co-occurrence Networkces. Stock price fluctuations of highly influential companies can have a major impact on the economy as a whole. In particular, the automobile industry is a colossal industry that leads the Japanese industry. However, the limitations in the number of available data sets usually become the hurdle for作者: Rinne-Test 時(shí)間: 2025-3-26 00:51 作者: majestic 時(shí)間: 2025-3-26 05:58 作者: 我的巨大 時(shí)間: 2025-3-26 11:33 作者: 極小量 時(shí)間: 2025-3-26 14:31
Variables vs. Parameters in the Interpretation of Natural Language Intensional Logic . and its extensional substratum . of two-sorted type theory. The two systems differ in their treatment of reference and quantification over indices (like possible worlds or times): whereas the denotations of .-formulae (.) depend on indices as parameters, their .-counterparts con作者: 光亮 時(shí)間: 2025-3-26 20:30 作者: BILL 時(shí)間: 2025-3-26 21:33
Towards a Unified, Semantically-Calculable and Anti-lexicalistic Analysis of Various Anaphoric Expre morphological formalisms. Inspired by[.], this paper proposes a substructure internal to NPs which mirrors the verb cartography. This mirroring tree constitutes a stacked continuation which takes all the verbal heads one by one from the bottom to the root of the sentence. The tree can then be broke作者: 生命 時(shí)間: 2025-3-27 02:44 作者: 變異 時(shí)間: 2025-3-27 06:32
Tying Free Choice in Questions to Distributivityons lead to free choice inferences if the .-phrases’s restrictor is plural and (ii) questions with collective predicates do not lead to uniqueness presuppositions. Such proposals, however, fail to derive the connection between (i-ii) and plurality. We propose a novel analysis in which (i-ii) are der作者: Fermentation 時(shí)間: 2025-3-27 12:44 作者: Mets552 時(shí)間: 2025-3-27 14:08 作者: 設(shè)想 時(shí)間: 2025-3-27 17:47
An Agent-Based Model for Exploring Pension Law and Social Security Policiesough experimentation in a simple and controllable scenario. Experimental results indicate that a constant or increasing population of uniformly distributed ages is not enough to ensure the sustainability of pension systems as backbone of the welfare state. A Web version of model implementation as we作者: Harridan 時(shí)間: 2025-3-28 00:15 作者: expound 時(shí)間: 2025-3-28 02:13 作者: 擦試不掉 時(shí)間: 2025-3-28 09:46
The Effect of Prosody on Veridicality Inferences in Koreantween the positive verbs (. ‘know’, . ‘remember’) and their negative suppletive counterparts (. ‘not know’, . ‘forget’) play an important role in deriving the prosodically-conditioned factivity inferences. In connection with this claim, I propose a new pragmatic principle that governs how alternativ作者: 有節(jié)制 時(shí)間: 2025-3-28 14:26
all over the world..The results confirm that our pipeline can quantify correctly the notion of controversy, reaching a ROC AUC score of 0.996 over controversial and non-controversial scores distributions. It outperforms the state-of-the-art approaches, both in terms of accuracy and computational sp作者: PLAYS 時(shí)間: 2025-3-28 15:40
all over the world..The results confirm that our pipeline can quantify correctly the notion of controversy, reaching a ROC AUC score of 0.996 over controversial and non-controversial scores distributions. It outperforms the state-of-the-art approaches, both in terms of accuracy and computational sp作者: 發(fā)酵 時(shí)間: 2025-3-28 22:02
Takahiro Komamizu,Kazuya Fujioka,Yasuhiro Ogawa,Katsuhiko Toyama all over the world..The results confirm that our pipeline can quantify correctly the notion of controversy, reaching a ROC AUC score of 0.996 over controversial and non-controversial scores distributions. It outperforms the state-of-the-art approaches, both in terms of accuracy and computational sp作者: 廚房里面 時(shí)間: 2025-3-29 02:07 作者: hidebound 時(shí)間: 2025-3-29 06:26 作者: 無(wú)法解釋 時(shí)間: 2025-3-29 09:03
Emilio Serrano,Ken Satohes of problems are known as position-restricted and contain querying, reporting, rank, selection etc. Persistency can be utilized to obtain solutions for these problems on prefixes of the text, by solving these problems on previous versions of the suffix tree. However, for substrings it is not suffi作者: accordance 時(shí)間: 2025-3-29 14:50 作者: brother 時(shí)間: 2025-3-29 19:22 作者: decipher 時(shí)間: 2025-3-29 21:13
Yoshihiro Nishi,Aiko Suge,Hiroshi Takahashiabet size . and a sampled inverse suffix array at sampling rate .. This is often a significant space gain in practice where . is usually much smaller than . or even constant. The algorithm has average run-time . and worst case run-time .. It can be improved to . worst case time while keeping the sam作者: 摘要記錄 時(shí)間: 2025-3-30 02:59 作者: 種類(lèi) 時(shí)間: 2025-3-30 04:08 作者: 幻影 時(shí)間: 2025-3-30 10:09
Sunwoo Jeongause of change of popularity of items over time, existence of time dependent ranking features, or addition or removal of items to the index (an item getting sold or a new item being listed). However, our method is general and can be applied to any search engine for which the rank of the same documen作者: immunity 時(shí)間: 2025-3-30 13:24
Paul M. Pietroski that the WSCS problem cannot be solved in . time or in . with time, where the . notation suppresses factors polynomial with respect to the instance size (with numeric values encoded in binary), unless there is a breakthrough improving upon long-standing upper bounds for fundamental NP-hard problems作者: obsolete 時(shí)間: 2025-3-30 20:01
Jan K?pping,Thomas Ede Zimmermannause of change of popularity of items over time, existence of time dependent ranking features, or addition or removal of items to the index (an item getting sold or a new item being listed). However, our method is general and can be applied to any search engine for which the rank of the same documen作者: 自由職業(yè)者 時(shí)間: 2025-3-30 21:38
Alastair Butler upper bound with a conditional matching lower bound stating that, unless the strong exponential time hypothesis (SETH) fails, the problem cannot be solved in strongly subquadratic time. The same problem is known to be PSPACE-complete when the input is an NFA (D’Agostino et al. Theoretical Computer 作者: 全等 時(shí)間: 2025-3-31 03:44
Noritsugu Hayashi space performance of these two programs are evaluated in comparison with eSAIS that is also implemented using STXXL. In our experiment, eSAIS runs the fastest for the input strings not larger than 16 GiB, but it is slower than SAIS-PQ+ for the only two input strings of 32 and 48.44 GiB. For the ave作者: 精致 時(shí)間: 2025-3-31 07:13
Oleg Kiselyov,Yuya Hoshino During this journey, we may encounter special cases like permutation strings, whose patterns are all distinct, and smoothed instances, which are a mixture of worst-case and average-case inputs..Finally, we shall discuss known gaps and open problems in the area, including variants of the basic edit 作者: neoplasm 時(shí)間: 2025-3-31 10:03
Filipe Hisao Kobayashi,Vincent Rouillardit is the fastest method for all collections, with a maximum speedup of 7.6. on the second best method. The peak memory is at most 2. larger than the second best method. Comparing with methods that are also, as our algorithm, able to report suffix array samples, we obtain a 57.1. improvement in peak作者: 大雨 時(shí)間: 2025-3-31 16:15
From Discourse to Logic with Stanford CoreNLP and Treebank Semanticsgainst a locally constrained global calculation. The calculation resolves the interpretation, including the accessibility of antecedents for pronouns and definites, but, most in particular, it is the system that decides predicate valency through self-regulation of the calculation to ensure results from a minimum of explicit input.作者: brachial-plexus 時(shí)間: 2025-3-31 19:08
Tying Free Choice in Questions to Distributivitysuppositions. Such proposals, however, fail to derive the connection between (i-ii) and plurality. We propose a novel analysis in which (i-ii) are derived via the presence of an existential distributivity operator. By tying these phenomena to distributivity, our analysis is able to establish the desired connection to plurality.作者: inferno 時(shí)間: 2025-4-1 01:03
