標(biāo)題: Titlebook: String Processing and Information Retrieval; 20th International S Oren Kurland,Moshe Lewenstein,Ely Porat Conference proceedings 2013 Sprin [打印本頁(yè)] 作者: cerebral 時(shí)間: 2025-3-21 19:49
書目名稱String Processing and Information Retrieval影響因子(影響力)
書目名稱String Processing and Information Retrieval影響因子(影響力)學(xué)科排名
書目名稱String Processing and Information Retrieval網(wǎng)絡(luò)公開度
書目名稱String Processing and Information Retrieval網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱String Processing and Information Retrieval被引頻次
書目名稱String Processing and Information Retrieval被引頻次學(xué)科排名
書目名稱String Processing and Information Retrieval年度引用
書目名稱String Processing and Information Retrieval年度引用學(xué)科排名
書目名稱String Processing and Information Retrieval讀者反饋
書目名稱String Processing and Information Retrieval讀者反饋學(xué)科排名
作者: narcissism 時(shí)間: 2025-3-21 20:19
Aline Bessa,Adriano Veloso,Nivio Zivianiiten für individuelle Notizen ist dieser Prüfungstrainer die beste Ausgangsbasis für den Einstieg in die vertiefende Literatur und den erfolgreichen Abschluss Ihrer Zoologie-Prüfung..978-3-662-61670-3978-3-662-61671-0作者: CREEK 時(shí)間: 2025-3-22 02:26
Guillermo de Bernardo,Sandra álvarez-García,Nieves R. Brisaboa,Gonzalo Navarro,Oscar Pedreira gestellten Aufgaben...Das Buch ist ein modernes Instrument zur Unterrichts- und Prüfungsvorbereitung, orientiert sich am neuen Lehrplan und ist entscheidungs- und handlungsorientiert aufgebaut. Die aus-gew?hl978-3-322-99800-2Series ISSN 2627-8588 Series E-ISSN 2627-8596 作者: allergen 時(shí)間: 2025-3-22 08:06 作者: saturated-fat 時(shí)間: 2025-3-22 11:54 作者: Generic-Drug 時(shí)間: 2025-3-22 15:55
Ferdinando Cicalese,Travis Gagie,Emanuele Giaquinta,Eduardo Sany Laber,Zsuzsanna Lipták,Romeo Rizzi,nd 4 konkrete Musterprüfungen, mit ausführlichen L?sungen, dem Leser die M?glichkeit sein Wissen final zu testen und dadurch den Stoff zu festigen..978-3-030-65885-4978-3-030-65886-1Series ISSN 2504-3641 Series E-ISSN 2504-3668 作者: right-atrium 時(shí)間: 2025-3-22 18:05
Francisco Claude,J. Ian Munrond 4 konkrete Musterprüfungen, mit ausführlichen L?sungen, dem Leser die M?glichkeit sein Wissen final zu testen und dadurch den Stoff zu festigen..978-3-030-65885-4978-3-030-65886-1Series ISSN 2504-3641 Series E-ISSN 2504-3668 作者: 王得到 時(shí)間: 2025-3-23 00:16
Francisco Claude,J. Ian Munrond 4 konkrete Musterprüfungen, mit ausführlichen L?sungen, dem Leser die M?glichkeit sein Wissen final zu testen und dadurch den Stoff zu festigen..978-3-030-65885-4978-3-030-65886-1Series ISSN 2504-3641 Series E-ISSN 2504-3668 作者: 全國(guó)性 時(shí)間: 2025-3-23 05:26 作者: forthy 時(shí)間: 2025-3-23 09:32 作者: 荒唐 時(shí)間: 2025-3-23 12:06 作者: invert 時(shí)間: 2025-3-23 15:01 作者: Admonish 時(shí)間: 2025-3-23 19:45
Pawe? Gawrychowski,Gregory Kucherov,Yakov Nekrich,Tatiana Starikovskaya作者: 河流 時(shí)間: 2025-3-23 22:16
Oren Kurland,Moshe Lewenstein,Ely PoratProceedings of the 20th International Symposium on String Processing and Information Retrieval, SPIRE 2013作者: 出血 時(shí)間: 2025-3-24 02:31 作者: Prophylaxis 時(shí)間: 2025-3-24 07:56
String Processing and Information Retrieval978-3-319-02432-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 植物群 時(shí)間: 2025-3-24 11:23 作者: 高腳酒杯 時(shí)間: 2025-3-24 17:58
https://doi.org/10.1007/978-3-319-02432-5combinatorial algorithms; graphs; information retrieval; query processing; search engines; algorithm anal作者: 發(fā)源 時(shí)間: 2025-3-24 21:47
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs,w how, given a tree containing two colours, we can build a quadratic-space index with which we can find a match in time proportional to the size of the match. We also show how we need only linear space if we are content with approximate matches.作者: overwrought 時(shí)間: 2025-3-25 00:13
Top-, Color Queries on Tree Paths,to efficiently answer queries for the top . distinct colors on the path between two nodes, reporting the colors sorted in descending order. Our data structure requires linear space of .(.) words and answers queries in .(.) time.作者: 誤傳 時(shí)間: 2025-3-25 04:34
Minimal Discriminating Words Problem Revisited,tensions of . which occur in less than . documents, and (ii) all shortest extensions of . which occur only in . . documents. For the first problem, we give an optimal solution with constant time per output word. For the second problem, we propose an algorithm with running time .(|.|?+?.·(1?+?.)) improving the solution of [5].作者: 異端 時(shí)間: 2025-3-25 07:40 作者: 一瞥 時(shí)間: 2025-3-25 14:49
Aline Bessa,Adriano Veloso,Nivio Zivianiorphologischen und ?kologischen Merkmale systematisch relevaDieser Prüfungstrainer führt als roter Faden durch das komplexe Gebiet der Speziellen Zoologie mit einem überblick über alle systematisch relevanten Tiergruppen. Anhand vieler Beispiele bietet dieses Buch eine Reise durch das gesamte Tierre作者: 提煉 時(shí)間: 2025-3-25 16:09 作者: 不要不誠(chéng)實(shí) 時(shí)間: 2025-3-25 22:09
Carolina Bonacic,Mauricio Marinch Entwicklungspsychologie, Siegler et al., 4. Aufl. (ISBN 9.Dieser Prüfungstrainer richtet sich in erster Linie an Studierende, die mit dem Lehrbuch ?Entwicklungspsychologie im Kindes- und Jugendalter“ arbeiten..Der Prüfungstrainer bietet.eine Auswahl unterschiedlicher Frageformate zu jedem Kapitel作者: 加花粗鄙人 時(shí)間: 2025-3-26 00:56
Daniele Broccolo,Craig Macdonald,Salvatore Orlando,Iadh Ounis,Raffaele Perego,Fabrizio Silvestri,Nic Kernthemen.Speziell geeignet zur Vorbereitung auf Assessmen.Dieses Trainingsbuch ist das ideale Begleitbuch für alle Bachelorstudierenden im Fach Mathematik und für die Grundlagenvorlesungen in ingenieur-, natur- und wirtschaftswissenschaftlichen Studieng?ngen. Es ist speziell geeignet zur Vorberei作者: BILIO 時(shí)間: 2025-3-26 04:59 作者: BROW 時(shí)間: 2025-3-26 11:36
Francisco Claude,J. Ian Munro Kernthemen.Speziell geeignet zur Vorbereitung auf Assessmen.Dieses Trainingsbuch ist das ideale Begleitbuch für alle Bachelorstudierenden im Fach Mathematik und für die Grundlagenvorlesungen in ingenieur-, natur- und wirtschaftswissenschaftlichen Studieng?ngen. Es ist speziell geeignet zur Vorberei作者: Kindle 時(shí)間: 2025-3-26 15:32
Francisco Claude,J. Ian Munro Kernthemen.Speziell geeignet zur Vorbereitung auf Assessmen.Dieses Trainingsbuch ist das ideale Begleitbuch für alle Bachelorstudierenden im Fach Mathematik und für die Grundlagenvorlesungen in ingenieur-, natur- und wirtschaftswissenschaftlichen Studieng?ngen. Es ist speziell geeignet zur Vorberei作者: 要控制 時(shí)間: 2025-3-26 19:04
Maxime Crochemore,Costas S. Iliopoulos,Tomasz Kociumaka,Marcin Kubica,Alessio Langiu,Solon P. Pissisnheit und Handlungsorientie-rung. Es bietet die M?glichkeit das in der praktischen Ausbildung im Kreditinstitut und im Unterricht der Berufsschule erlernte Wissen selbst?ndig anzuwenden. Darüber hinaus dient es der systematischen Vorbereitung auf die Abschlussprüfung zur Bankkauffrau bezie-hungsweis作者: 劇本 時(shí)間: 2025-3-26 22:52 作者: 易于 時(shí)間: 2025-3-27 04:51 作者: Lime石灰 時(shí)間: 2025-3-27 06:23 作者: GLIDE 時(shí)間: 2025-3-27 09:41 作者: JUST 時(shí)間: 2025-3-27 14:53
Query Processing in Highly-Loaded Search Engines,ixed time threshold elapses or dropped completely. Moreover, we introduce a novel dropping strategy, based on machine learned performance predictors to select the queries to drop in order to sustain the largest possible query rate with a relative degradation in effectiveness.作者: 現(xiàn)存 時(shí)間: 2025-3-27 19:15
Compact Querieable Representations of Raster Data,ly store and query raster datasets in main memory. We experimentally compare our proposals with traditional storage mechanisms for raster data, showing that our structures obtain competitive space performance while efficiently answering range queries involving the values stored in the raster.作者: Hamper 時(shí)間: 2025-3-27 23:12
Conference proceedings 2013atured 4 keynote speeches. The following topics are covered: fundamentals algorithms in string processing and information retrieval; SP and IR techniques as applied to areas such as computational biology, DNA sequencing, and Web mining.作者: Sputum 時(shí)間: 2025-3-28 02:43
Consolidating and Exploring Information via Textual Inference, challenge. It is well illustrated by the perpetual attempts to move away from the flat result lists of search engines towards more structured fact-based presentations. Some recent attempts at this challenge are based on presenting structured information that was formulated according to pre-defined 作者: 一條卷發(fā) 時(shí)間: 2025-3-28 07:14 作者: Sad570 時(shí)間: 2025-3-28 11:49 作者: 善于騙人 時(shí)間: 2025-3-28 14:52 作者: anticipate 時(shí)間: 2025-3-28 20:57
Space-Efficient Construction of the Burrows-Wheeler Transform,e many problems in bioinformatics. However, the memory requirement during the construction of the . is often the bottleneck in applications in the bioinformatics domain..In this paper, we present a linear-time semi-external algorithm whose memory requirement is only about one byte per input symbol. 作者: 漂亮才會(huì)豪華 時(shí)間: 2025-3-29 02:12
Using Mutual Influence to Improve Recommendations,he way we model mutual influence is cheap and can be computed without requiring any source of content information about either items or users. We propose an algorithm that considers mutual influence to generate recommendations and analyse it over different recommendation datasets. We compare our alg作者: 率直 時(shí)間: 2025-3-29 05:52
Position-Restricted Substring Searching over Small Alphabets,cted substring searching queries. The query input consists of a pattern . (of length .) and two indices ? and . and the output is the set of all . . occurrences of . in .[?....]. In this paper, we propose an .(.log.)-word space index with .(.?+?. .loglog.) query time. Our solution is interesting whe作者: COM 時(shí)間: 2025-3-29 11:08 作者: 蔓藤圖飾 時(shí)間: 2025-3-29 14:21
Query Processing in Highly-Loaded Search Engines, computing infrastructure. We study how response times and results vary when, in presence of high loads, some queries are either interrupted after a fixed time threshold elapses or dropped completely. Moreover, we introduce a novel dropping strategy, based on machine learned performance predictors t作者: Yourself 時(shí)間: 2025-3-29 17:12 作者: 悲痛 時(shí)間: 2025-3-29 20:51
Adaptive Data Structures for Permutations and Binary Relations, general information theoretic lower bound, while achieving reasonable space complexities in the worst case. Our approach is derived from a geometric data structure [Arroyuelo et al., TCS 2011]. When used for representing permutations, it converges to a previously known adaptive representation [Barb作者: 不要不誠(chéng)實(shí) 時(shí)間: 2025-3-30 00:57
Document Listing on Versioned Documents, for an exact substring and retrieve the documents that contain the substring. This problem is called ...We present an index for the document listing problem on versioned documents. Our index is the first one based on grammar-compression. This allows for good results on repetitive collections, where作者: hematuria 時(shí)間: 2025-3-30 05:58 作者: expository 時(shí)間: 2025-3-30 09:10
Compact Querieable Representations of Raster Data,are no compact representations of raster data that provide efficient query capabilities. In this paper we propose compact representations to efficiently store and query raster datasets in main memory. We experimentally compare our proposals with traditional storage mechanisms for raster data, showin作者: encomiast 時(shí)間: 2025-3-30 15:34
Top-, Color Queries on Tree Paths,to efficiently answer queries for the top . distinct colors on the path between two nodes, reporting the colors sorted in descending order. Our data structure requires linear space of .(.) words and answers queries in .(.) time.作者: figure 時(shí)間: 2025-3-30 19:47 作者: 自負(fù)的人 時(shí)間: 2025-3-30 23:18 作者: Benzodiazepines 時(shí)間: 2025-3-31 03:26
Adding Compression and Blended Search to a Compact Two-Level Suffix Array,and can handle strings larger than the available memory. Assuming the latter situation, we introduce a factor-based mechanism for compressing the text string that integrates seamlessly with the in-memory index search structure, rather than requiring a separate dictionary. We also introduce a mixture作者: Chromatic 時(shí)間: 2025-3-31 08:39 作者: 絕種 時(shí)間: 2025-3-31 11:37
Consolidating and Exploring Information via Textual Inference,es, formulated under the Textual Entailment paradigm, are used to consolidate redundant information into unique “core” statements, and then present them in an intuitive general-to-specific hierarchy. The talk will review some of the underlying concepts and algorithms behind our approach and present an initial demo.作者: 面包屑 時(shí)間: 2025-3-31 15:33
Simulation Study of Multi-threading in Web Search Engine Processors,ons of the multi-threading strategies to then go further on studying performance on very large processors. We conclude that intra-query parallelism scales up more efficiently than inter-query parallelism.作者: expunge 時(shí)間: 2025-3-31 17:53 作者: canvass 時(shí)間: 2025-3-31 22:31 作者: modish 時(shí)間: 2025-4-1 04:57 作者: crescendo 時(shí)間: 2025-4-1 07:46 作者: Resign 時(shí)間: 2025-4-1 10:34
Position-Restricted Substring Searching over Small Alphabets,-known linear space index by Navarro and Nekrich [SWAT 2012] with .(.?+?. .log. .) query time, where .?>?0 is any positive constant. We also study the property matching problem and provide an improved index for handling semi-dynamic (only insertions) properties, where we use position-restricted substring queries as the main technique.作者: 信徒 時(shí)間: 2025-4-1 15:25
Document Listing on Versioned Documents,llowing users to search for word-based phrase queries and conjunctive queries at the same time..Finally, we discuss extensions that may be possible in the future, for example, supporting ranking capabilities within the index itself.作者: 星球的光亮度 時(shí)間: 2025-4-1 19:28
A Lempel-Ziv Compressed Structure for Document Listing,e for the final ones. This makes this index particularly useful for interactive scenarios or when listing some documents is sufficient. Yet, it also offers a competitive space/time tradeoff when returning the full answers.
