Titlebook: Web Technologies and Applications; 15th Asia-Pacific We Yoshiharu Ishikawa,Jianzhong Li,Wenjie Zhang Conference proceedings 2013 Springer-V

GUISE

Understanding Short Textshan 2 million concepts, harnessed automatically from a corpus of 1.68 billion web pages and two years worth of search-log data. It enables probabilistic interpretations of search queries, document titles, ad keywords, etc. The probabilistic nature also enables it to incorporate heterogeneous informa

CLAMP

Energy Efficiency in W-Grid Data-Centric Sensor Networks via Workload Balancing through multi-hop routing among devices. In this paper, we show that network traffic, and thus the energy consumption, can be . among sensors by assigning multiple . to nodes trough a ., which extends W-Grid.

fluffy

高度贊揚(yáng)

煩躁的女人

K Hops Frequent Subgraphs Mining for Large Attribute GraphGraph Edit Distance. Then, frequent labeled subgraphs will be merged into attribute subgraphs by integration according to designated attributes. The complexity of our mechanism is approximately O(2.), which is more efficient than existing algorithms. Real data sets are applied in experiments to demo

其他

Correlation Mining in Graph Databases with a New Measureposed a new graph correlation measure, ., to efficiently extract useful graph patterns along with a method . (.orrelated .raph .ining), to find the underlying correlations among graphs in graph databases using the proposed measure. Finally, extensive performance analysis of our scheme proved two tim

復(fù)習(xí)

分散

Improved Parallel Processing of Massive De Bruijn Graph for Genome Assemblyertices, which results in a huge amount of communications between computing nodes. Therefore, we propose to use depth-first traversal over the underlying?De Bruijn graph once to achieve the same objective as the existing list ranking approach. The new method is fast, effective and can be executed in

Nucleate

Improved Parallel Processing of Massive De Bruijn Graph for Genome Assemblyertices, which results in a huge amount of communications between computing nodes. Therefore, we propose to use depth-first traversal over the underlying?De Bruijn graph once to achieve the same objective as the existing list ranking approach. The new method is fast, effective and can be executed in

表主動(dòng)

0302-9743 wing workshops: second international workshop on data management for emerging network infrastructure, international workshop on soical media analytics and recommendation technologies, and international workshop on management of spatial temporal data.978-3-642-37400-5978-3-642-37401-2Series ISSN 0302-9743 Series E-ISSN 1611-3349