Sciweavers

1288 search results - page 130 / 258
» Algorithmic detection of semantic similarity
Sort
View
JCP
2008
171views more  JCP 2008»
13 years 10 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen
TPDS
2008
91views more  TPDS 2008»
13 years 10 months ago
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of inform...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam, Jin...
ICWE
2010
Springer
14 years 2 months ago
Ranking the Linked Data: The Case of DBpedia
The recent proliferation of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scal...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...
CISS
2008
IEEE
14 years 4 months ago
The Chinese Generals Problem
Abstract—To achieve higher reliability, safety, and faulttolerance, many mission-critical detection and decision systems implement consensus algorithms that force the systems’ ...
Edwin Soedarmadji
AAIM
2007
Springer
118views Algorithms» more  AAIM 2007»
14 years 2 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
Marco Gaertler, Robert Görke, Dorothea Wagner