Sciweavers

174 search results - page 24 / 35
» Efficient Compression of Web Graphs
Sort
View
WWW
2008
ACM
14 years 10 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
WWW
2008
ACM
14 years 10 months ago
Learning multiple graphs for document recommendations
The Web offers rich relational data with different semantics. In this paper, we address the problem of document recommendation in a digital library, where the documents in questio...
Ding Zhou, Shenghuo Zhu, Kai Yu, Xiaodan Song, Bel...
IANDC
2008
141views more  IANDC 2008»
13 years 10 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
JSW
2008
203views more  JSW 2008»
13 years 9 months ago
Automatic Discovery of Semantic Relations Based on Association Rule
Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explore...
Xiangfeng Luo, Kai Yan, Xue Chen
MM
2000
ACM
91views Multimedia» more  MM 2000»
14 years 2 months ago
A prediction system for multimedia pre-fetching in Internet
The rapid development of Internet has resulted in more and more multimedia in Web content. However, due to the limitation in the bandwidth and huge size of the multimedia data, us...
Zhong Su, Qiang Yang, HongJiang Zhang