Sciweavers

919 search results - page 110 / 184
» Standard Data Representations for VLSI Algorithm Development
Sort
View
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
15 years 1 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
WWW
2008
ACM
15 years 10 months ago
Scaling RDF with time
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
Andrea Pugliese, Octavian Udrea, V. S. Subrahmania...
KDD
2009
ACM
243views Data Mining» more  KDD 2009»
15 years 10 months ago
Exploiting Wikipedia as external knowledge for document clustering
In traditional text clustering methods, documents are represented as "bags of words" without considering the semantic information of each document. For instance, if two ...
Xiaohua Hu, Xiaodan Zhang, Caimei Lu, E. K. Park, ...
INTERACTION
2009
ACM
15 years 4 months ago
DTD2OWL: automatic transforming XML documents into OWL ontology
DTD and its instance have been considered the standard for data representation and information exchange format on the current web. However, when coming to the next generation of w...
Pham Thi Thu Thuy, Young-Koo Lee, Sungyoung Lee
ICANN
2009
Springer
15 years 4 months ago
Basis Decomposition of Motion Trajectories Using Spatio-temporal NMF
Abstract. This paper’s intention is to present a new approach for decomposing motion trajectories. The proposed algorithm is based on nonnegative matrix factorization, which is a...
Sven Hellbach, Julian Eggert, Edgar Körner, H...