標題: Titlebook: Database Systems for Advanced Applications; 18th International C Weiyi Meng,Ling Feng,Wei Song Conference proceedings 2013 Springer-Verlag [打印本頁] 作者: damped 時間: 2025-3-21 19:31
書目名稱Database Systems for Advanced Applications影響因子(影響力)
書目名稱Database Systems for Advanced Applications影響因子(影響力)學科排名
書目名稱Database Systems for Advanced Applications網(wǎng)絡公開度
書目名稱Database Systems for Advanced Applications網(wǎng)絡公開度學科排名
書目名稱Database Systems for Advanced Applications被引頻次
書目名稱Database Systems for Advanced Applications被引頻次學科排名
書目名稱Database Systems for Advanced Applications年度引用
書目名稱Database Systems for Advanced Applications年度引用學科排名
書目名稱Database Systems for Advanced Applications讀者反饋
書目名稱Database Systems for Advanced Applications讀者反饋學科排名
作者: CURL 時間: 2025-3-21 23:17 作者: BRIEF 時間: 2025-3-22 01:29 作者: biosphere 時間: 2025-3-22 06:57 作者: LAP 時間: 2025-3-22 10:28 作者: 潛伏期 時間: 2025-3-22 16:39 作者: 潛伏期 時間: 2025-3-22 19:46 作者: Aerate 時間: 2025-3-22 21:47 作者: 鎮(zhèn)壓 時間: 2025-3-23 03:11 作者: 玩笑 時間: 2025-3-23 09:18
Contemporary Popular Music Studies to measure the inference resistance of our proposed method. This measure is quantized by the entropy values and attribute value diversities in query results. We have conducted some experiments to validate our proposed method.作者: fibroblast 時間: 2025-3-23 10:13 作者: 向宇宙 時間: 2025-3-23 15:13 作者: ascetic 時間: 2025-3-23 20:07 作者: 袋鼠 時間: 2025-3-24 01:42 作者: ABIDE 時間: 2025-3-24 02:25
Generalization-Based Private Indexes for Outsourced Databases to measure the inference resistance of our proposed method. This measure is quantized by the entropy values and attribute value diversities in query results. We have conducted some experiments to validate our proposed method.作者: 壯麗的去 時間: 2025-3-24 09:14 作者: 先鋒派 時間: 2025-3-24 14:25 作者: 拋射物 時間: 2025-3-24 14:49 作者: 誘騙 時間: 2025-3-24 21:35
0302-9743 fereed proceedings of the 18th International Conference on Database Systems for Advanced Applications, DASFAA 2013, held in Wuhan, China, in April 2013. The 51 revised full papers and 10 short papers presented together with 2 invited keynote talks, 1 invited paper, 3 industrial papers, 9 demo presen作者: 煤渣 時間: 2025-3-24 23:24 作者: 弄皺 時間: 2025-3-25 04:54 作者: 無孔 時間: 2025-3-25 11:04
Community Expansion in Social Networken a greedy algorithm . is developed for expanding a community over time. Our results from extensive simulation on several real-world networks demonstrate that our Combine Model performs effectively and outperforms other algorithms.作者: ADORN 時間: 2025-3-25 14:07
Similarity Joins on Item Set Collections Using Zero-Suppressed Binary Decision Diagramsagrams (BDDs), and are suitable for implicitly handling large-scale combinatorial item set data. We present, in this paper, the algorithms for similarity joins between two data collections represented as ZDDs and pruning techniques. We also present the experimental results obtained by comparing thei作者: 墊子 時間: 2025-3-25 18:09
Adaptive Query Scheduling in Key-Value Data Stores To this end, we propose the . scheduling strategy, which allows for selective data refreshing and integrates the benefits of SJF-based scheduling with an EDF-like policy. Our experiments demonstrate the effectiveness of our method, which does not only strike a fine trade-off between QoS and QoD but作者: TAG 時間: 2025-3-25 21:57
Distributed AH-Tree Based Index Technology for Multi-channel Wireless Data Broadcasto the best of our knowledge, we are the first to propose a detailed, fast, and distributed .-ary AH-Tree index with allocation protocol, which has both theoretical and practical significance in this area.作者: epicardium 時間: 2025-3-26 03:26
Beyond Click Graph: Topic Modeling for Search Engine Query Log Analysiss the clicking behavior explicitly and models the ternary relation between search queries, query terms and URLs. We evaluate the three proposed models against several strong baselines on a real-life query log. The experimental results show that the proposed models demonstrate significantly improved 作者: 遣返回國 時間: 2025-3-26 06:40
Continuous Topically Related Queries Grouping and Its Application on Interest IdentificationQs accurately, we propose the Pattern-Concept-Time-Based (PCTB) method that utilizes query reformulation patterns, concepts behind the queries and the user’s continuous searching behavior to compute the similarity between two queries. To evaluate the effectiveness of our approach, we employ the AOL 作者: scotoma 時間: 2025-3-26 11:18 作者: Mortar 時間: 2025-3-26 14:15
Gabriel Keehn,Morgan Anderson,Deron Boylestion are specified in user queries..Search intent discovery is a hot research area in Web search, such as search query classification (informational, navigational and transactional queries), search result diversification, and query recommendation..In this talk, after a brief survey on the research o作者: Infinitesimal 時間: 2025-3-26 19:08
Contemporary Photography as Collaborationcture and domain information related to an answerer (e.g., answer quality) is critical for inferring the expertise of users. Based on this observation, we propose the . framework to compute users’ expertise. We establish that the information used has a bearing on the accuracy of results. We present 作者: 率直 時間: 2025-3-27 00:22
Contemporary Photography as Collaborationen a greedy algorithm . is developed for expanding a community over time. Our results from extensive simulation on several real-world networks demonstrate that our Combine Model performs effectively and outperforms other algorithms.作者: 先行 時間: 2025-3-27 04:28
Contemporary Photography as Collaborationagrams (BDDs), and are suitable for implicitly handling large-scale combinatorial item set data. We present, in this paper, the algorithms for similarity joins between two data collections represented as ZDDs and pruning techniques. We also present the experimental results obtained by comparing thei作者: 大量 時間: 2025-3-27 08:02
Mathilde Bertrand,Karine Chambefort-Kay To this end, we propose the . scheduling strategy, which allows for selective data refreshing and integrates the benefits of SJF-based scheduling with an EDF-like policy. Our experiments demonstrate the effectiveness of our method, which does not only strike a fine trade-off between QoS and QoD but作者: addition 時間: 2025-3-27 09:36
https://doi.org/10.1007/978-3-658-25253-3o the best of our knowledge, we are the first to propose a detailed, fast, and distributed .-ary AH-Tree index with allocation protocol, which has both theoretical and practical significance in this area.作者: 抗原 時間: 2025-3-27 15:47
Prime Ministerial Power and the Medias the clicking behavior explicitly and models the ternary relation between search queries, query terms and URLs. We evaluate the three proposed models against several strong baselines on a real-life query log. The experimental results show that the proposed models demonstrate significantly improved 作者: 受人支配 時間: 2025-3-27 20:49
States in the international arbitral processQs accurately, we propose the Pattern-Concept-Time-Based (PCTB) method that utilizes query reformulation patterns, concepts behind the queries and the user’s continuous searching behavior to compute the similarity between two queries. To evaluate the effectiveness of our approach, we employ the AOL 作者: 易發(fā)怒 時間: 2025-3-27 22:22
Can We Predict User Intents from Queries?n and recall) because of the following reasons:.(1) Queries for search engines are mostly limited to keywords or short natural language sentences, and.(2) Most search engines use traditional “keyword-in-document” information retrieval models..Obviously, a user’s search intent is not easily expressed作者: 1FAWN 時間: 2025-3-28 04:13
Finding Rising Stars in Social Networksthe beginning of their career but may become prominent contributors in the future. An effort for finding rising stars named PubRank is proposed, which considers mutual influence and static ranking of conferences or journals. In this work an improvement of PubRank is proposed by considering authors’ 作者: 令人悲傷 時間: 2025-3-28 07:07 作者: 連鎖,連串 時間: 2025-3-28 12:10 作者: motor-unit 時間: 2025-3-28 18:03 作者: grieve 時間: 2025-3-28 22:05 作者: 障礙物 時間: 2025-3-28 23:19 作者: Liability 時間: 2025-3-29 05:49 作者: Instinctive 時間: 2025-3-29 08:22
AVR-Tree: Speeding Up the NN and ANN Queries on Location Dataof applications such as Geographic Information System (GIS) and Location based Service (LBS). We propose a new structure, termed AVR-Tree, based on the R-tree and Voronoi diagram techniques. Compared with the existing indexing techniques used for NN and ANN queries on location data, AVR-Tree can ach作者: peritonitis 時間: 2025-3-29 13:21 作者: Oligarchy 時間: 2025-3-29 19:01 作者: 挑剔小責 時間: 2025-3-29 20:45 作者: indignant 時間: 2025-3-30 01:42 作者: crucial 時間: 2025-3-30 06:08 作者: graphy 時間: 2025-3-30 09:12 作者: 五行打油詩 時間: 2025-3-30 14:13
Beyond Click Graph: Topic Modeling for Search Engine Query Log Analysis utilized to analyze the information in query log. However, click graph is usually plagued by low information coverage, failure of capturing the diverse types of co-occurrence and the incapability of discovering the latent semantics in data. In this paper, we go beyond click graph and analyze query 作者: exclusice 時間: 2025-3-30 20:15
Continuous Topically Related Queries Grouping and Its Application on Interest Identificationf a few minutes, or a long period of time like months or years. In the latter, the user may perform searching related to a particular interest from time to time, making the queries related to that interest sporadically distributed in the search log. Identification of these topically related queries 作者: Comprise 時間: 2025-3-31 00:25 作者: Commemorate 時間: 2025-3-31 03:45
978-3-642-37486-9Springer-Verlag Berlin Heidelberg 2013作者: Resistance 時間: 2025-3-31 07:06
Weiyi Meng,Ling Feng,Wei SongUp to date results.Fast track conference proceedings.State of the art research作者: 獸群 時間: 2025-3-31 13:04
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263441.jpg作者: Graves’-disease 時間: 2025-3-31 16:12 作者: FLASK 時間: 2025-3-31 21:23 作者: 易受騙 時間: 2025-4-1 00:01
Data Overload: What Can We Do?ICT is changing the world. It is changing both individuals and our society. One very intriguing change is that everybody has become both a consumer and a producer..Before, the production of books and music went through a whole procedure to guarantee quality. Nowadays everyone is putting Youtube videos on the internet, regardless of the quality.作者: 先鋒派 時間: 2025-4-1 03:32
Record Linkage: A 10-Year RetrospectiveWe describe how we wrote the DASFAA 2003 paper titled ”Efficient Record Linkage in Large Data Sets” that received the DASFAA 2013 ten-year best paper award, and the followup research after the paper.
