標(biāo)題: Titlebook: Database Systems for Advanced Applications; 22nd International C Sel?uk Candan,Lei Chen,Wen Hua Conference proceedings 2017 Springer Intern [打印本頁] 作者: ARRAY 時(shí)間: 2025-3-21 16:50
書目名稱Database Systems for Advanced Applications影響因子(影響力)
書目名稱Database Systems for Advanced Applications影響因子(影響力)學(xué)科排名
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Systems for Advanced Applications被引頻次
書目名稱Database Systems for Advanced Applications被引頻次學(xué)科排名
書目名稱Database Systems for Advanced Applications年度引用
書目名稱Database Systems for Advanced Applications年度引用學(xué)科排名
書目名稱Database Systems for Advanced Applications讀者反饋
書目名稱Database Systems for Advanced Applications讀者反饋學(xué)科排名
作者: 確定 時(shí)間: 2025-3-22 00:05
HyMU: A Hybrid Map Updating Frameworkrantee completeness and validity of the map. The common problems of them involve huge computation and low precision. More importantly, they scarcely consider inferring new roads on sparse unmatched trajectories. In this paper, we first address the issue of finding new roads in sparse trajectory area作者: 旁觀者 時(shí)間: 2025-3-22 00:31 作者: 就職 時(shí)間: 2025-3-22 05:18
RSkycube: Efficient Skycube Computation by Reusing Principlehe skycube computation is proposed to compute skylines, or cuboids, on all possible non-empty dimension subsets. The key issue of computing skycube is how to share computation among multiple related cuboids, which classified into . and .. However, state-of-the-art algorithm only leverages . to compu作者: Acupressure 時(shí)間: 2025-3-22 09:52
Similarity Search Combining Query Relaxation and Diversificatione result number and result quality, we combine query result diversity with query relaxation. Relaxation guarantees the number of the query results, returning more relevant elements to the query if the results are too few, while the diversity tries to reduce the similarity among the returned results.作者: Asparagus 時(shí)間: 2025-3-22 15:54 作者: Asparagus 時(shí)間: 2025-3-22 21:02 作者: 無瑕疵 時(shí)間: 2025-3-22 21:12 作者: abysmal 時(shí)間: 2025-3-23 02:58
Towards a Query-Less News Search Framework on Twitterng for related content may be a tedious process. Formulating an effective search query is not a trivial task. And due to the often small size of smart phone screens, instead of typing, users always prefer click-based operations to retrieve related content. To address these issues, we introduce a new作者: 清晰 時(shí)間: 2025-3-23 09:06 作者: 一罵死割除 時(shí)間: 2025-3-23 10:22
An Improved Approach for Long Tail Advertising in Sponsored Searchrs also tend to target head query keywords, thereby creating an imbalance in demand for head and tail keywords. This leads to under-utilization of ad space of tail query keywords. In this paper, we have explored a mechanism that allows the advertisers to bid on concepts rather than keywords. The tai作者: 大雨 時(shí)間: 2025-3-23 14:23 作者: 生來 時(shí)間: 2025-3-23 18:56 作者: Sputum 時(shí)間: 2025-3-24 00:11
Efficient Regular Expression Matching on Compressed Stringsgs, such as high compression ratio and slower decompression speed than LZ77 (a variant of LZ78). In this paper, we study regular expression matching on LZ77 compressed strings. To address this problem, we propose an efficient algorithm, namely, ., utilizing the ., i.e., a prefix and a suffix, and . 作者: CLAP 時(shí)間: 2025-3-24 03:08
Mining Top-, Distinguishing Temporal Sequential Patterns from Event Sequencesnalysis. Distinguishing sequential patterns can help characterize the differences between two or more sets/classes of sequences, and can be used to understand those sequence sets/classes and to identify informative features for classification and so on. However, previous studies have not considered 作者: hermitage 時(shí)間: 2025-3-24 08:40
Similarity Search Combining Query Relaxation and Diversification and processes queries in several small sets to retrieve more diverse results. The balance of similarity and diversity is determined through setting a threshold, which has a default value and can be adjusted according to users’ preference. The performance and efficiency of our system are demonstrate作者: 轉(zhuǎn)折點(diǎn) 時(shí)間: 2025-3-24 11:19
Approximate OLAP on Sustained Data Streamsata streams’ summaries in comparatively smaller space and can give approximate answers to OLAP queries..OLAP analysts query different nodes in the OLAP cube interactively. To support such analysis by the PLA-based data cube without the unnecessary amplification of querying errors, inherent in the PL作者: 搏斗 時(shí)間: 2025-3-24 16:10 作者: calumniate 時(shí)間: 2025-3-24 22:46 作者: crockery 時(shí)間: 2025-3-25 00:58
An Improved Approach for Long Tail Advertising in Sponsored Searche of level-wise coverage patterns to allocate incoming search queries to advertisers in an efficient manner by utilizing the long tail. Experimental results on AOL search query data set show improvement in ad space utilization and reach of advertisers.作者: 錯(cuò)誤 時(shí)間: 2025-3-25 06:34
Locating Longest Common Subsequences with Limited Penaltyopose a filter-refine approach to reduce number of candidates. We also adopt suffix array to efficiently generate common substrings, which helps calculating the problem. Experimental results on three real data sets show the effectiveness and efficiency of our algorithms.作者: 法律 時(shí)間: 2025-3-25 09:32
Efficient Regular Expression Matching on Compressed Stringsnsive performance evaluation using five real datasets to validate our ideas and the proposed algorithms. The experimental result shows that our RELZ algorithm outperforms the existing algorithms significantly.作者: 平淡而無味 時(shí)間: 2025-3-25 12:06 作者: palliative-care 時(shí)間: 2025-3-25 18:54
The Academy of International Business and processes queries in several small sets to retrieve more diverse results. The balance of similarity and diversity is determined through setting a threshold, which has a default value and can be adjusted according to users’ preference. The performance and efficiency of our system are demonstrate作者: AVANT 時(shí)間: 2025-3-25 22:36
Kevin Ibeh,Oliver Borchert,Colin Wheelerata streams’ summaries in comparatively smaller space and can give approximate answers to OLAP queries..OLAP analysts query different nodes in the OLAP cube interactively. To support such analysis by the PLA-based data cube without the unnecessary amplification of querying errors, inherent in the PL作者: 謊言 時(shí)間: 2025-3-26 02:04
Beat J. Meyer,Lina Badimon,James H. Chesebrochical semantic representation model of news comments using multiple information sources, called Hierarchical Semantic Neural Network (HSNN). In particular, we begin with a novel neural network model to learn document representation in a bottom-up way, capturing not only the semantics within sentenc作者: 牙齒 時(shí)間: 2025-3-26 06:15 作者: Plaque 時(shí)間: 2025-3-26 11:23 作者: 做事過頭 時(shí)間: 2025-3-26 13:15 作者: 一再煩擾 時(shí)間: 2025-3-26 19:06
The Moral Status of Anencephalic ,nsive performance evaluation using five real datasets to validate our ideas and the proposed algorithms. The experimental result shows that our RELZ algorithm outperforms the existing algorithms significantly.作者: 進(jìn)步 時(shí)間: 2025-3-26 20:57 作者: 拒絕 時(shí)間: 2025-3-27 02:40
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263425.jpg作者: 外貌 時(shí)間: 2025-3-27 06:20
Database Systems for Advanced Applications978-3-319-55699-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Alveoli 時(shí)間: 2025-3-27 09:44 作者: 乳汁 時(shí)間: 2025-3-27 16:36
Andrzej Wi?ckowski,Alicja Sznurawarantee completeness and validity of the map. The common problems of them involve huge computation and low precision. More importantly, they scarcely consider inferring new roads on sparse unmatched trajectories. In this paper, we first address the issue of finding new roads in sparse trajectory area作者: 沒有貧窮 時(shí)間: 2025-3-27 18:20 作者: 制定 時(shí)間: 2025-3-27 23:09
Andrzej Wi?ckowski,Alicja Sznurawahe skycube computation is proposed to compute skylines, or cuboids, on all possible non-empty dimension subsets. The key issue of computing skycube is how to share computation among multiple related cuboids, which classified into . and .. However, state-of-the-art algorithm only leverages . to compu作者: Abutment 時(shí)間: 2025-3-28 05:28
The Academy of International Businesse result number and result quality, we combine query result diversity with query relaxation. Relaxation guarantees the number of the query results, returning more relevant elements to the query if the results are too few, while the diversity tries to reduce the similarity among the returned results.作者: 影響帶來 時(shí)間: 2025-3-28 06:26
Kevin Ibeh,Oliver Borchert,Colin Wheeler CQA sites often varies a lot from precise and useful ones to irrelevant and useless ones. Hence, automatic detection of low-quality answers will help the site managers efficiently organize the accumulated knowledge and provide high-quality contents to users. In this paper, we propose a novel unsupe作者: Enteropathic 時(shí)間: 2025-3-28 10:24
Kevin Ibeh,Oliver Borchert,Colin Wheelerods for the analysis of static data and has been studied by many researchers. OLAP is also applicable to data streams, however the requirement to produce real time analysis on fast and evolving data streams is not possible unless the data to be analysed reside on memory. Keeping in view the limited 作者: 誘騙 時(shí)間: 2025-3-28 15:12
Beat J. Meyer,Lina Badimon,James H. Chesebrostand the predilections and opinions of an individual user, and help news publishers to provide more relevant services. Neural network methods have achieved promising results, but still have challenges in the field of emotion tagging. Firstly, these methods regard the whole document as a stream or b作者: cinder 時(shí)間: 2025-3-28 21:20
Ambulatory Blood Pressure Monitoringng for related content may be a tedious process. Formulating an effective search query is not a trivial task. And due to the often small size of smart phone screens, instead of typing, users always prefer click-based operations to retrieve related content. To address these issues, we introduce a new作者: 具體 時(shí)間: 2025-3-29 00:38
Hypertension and Aortic Mechanicstion-like queries. Among these queries, “What” is one of the biggest segments. Since results excerpted from Wikipedia often have a coverage problem, some models begin?to rank definitions that are extracted from web documents, including Ranking SVM and Maximum Entropy Context Model. But they only ado作者: 衣服 時(shí)間: 2025-3-29 06:10 作者: 剝皮 時(shí)間: 2025-3-29 08:42 作者: delegate 時(shí)間: 2025-3-29 13:33
Sarah-Vaughan Brakman,Darlene Fozard Weaver based on the beginning of the currently input character sequence (i.e. prefix). However, in many real applications, one entity often has synonyms or abbreviations. For example, “.” is an abbreviation of “.”. In this paper, we study a novel type of auto-completion by using synonyms and abbreviations作者: 要控制 時(shí)間: 2025-3-29 18:28 作者: 寬容 時(shí)間: 2025-3-29 20:51 作者: 膠水 時(shí)間: 2025-3-30 02:50 作者: figurine 時(shí)間: 2025-3-30 04:05
978-3-319-55698-7Springer International Publishing AG 2017作者: Oafishness 時(shí)間: 2025-3-30 10:01 作者: MITE 時(shí)間: 2025-3-30 13:29 作者: 安定 時(shí)間: 2025-3-30 20:13
Conference proceedings 2017plications, DASFAA 2017, held in Suzhou, China, in March 2017. The 73 full papers, 9 industry papers, 4 demo papers and 3 tutorials were carefully selected from a total of 300 submissions. The papers are organized around the following topics: semantic web and knowledge management; indexing and distr作者: 吝嗇性 時(shí)間: 2025-3-30 23:21
Conference proceedings 2017tion; security, privacy, senor and cloud; social network analytics; map matching and spatial keywords; query processing and optimization; search and information retrieval; string and sequence processing; stream date processing; graph and network data processing; spatial databases; real time data processing; big data; social networks and graphs.作者: Diaphragm 時(shí)間: 2025-3-31 03:45 作者: agnostic 時(shí)間: 2025-3-31 08:58 作者: unstable-angina 時(shí)間: 2025-3-31 09:43
Andrzej Wi?ckowski,Alicja Sznurawa VSkyTree on parent cuboids to compute child cuboids. Then, in . fashion, we design an efficient skycube computation algorithm RSkycube based on the reusing principle. Our experimental results indicate that our algorithm RSkycube significantly outperforms state-of-the-art skycube computation algorithm on both synthetic and real datasets.
