Sciweavers

4009 search results - page 248 / 802
» Clustering on Complex Graphs
Sort
View
SIGMOD
2003
ACM
237views Database» more  SIGMOD 2003»
16 years 5 months ago
Qcluster: Relevance Feedback Using Adaptive Clustering for Content-Based Image Retrieval
The learning-enhanced relevance feedback has been one of the most active research areas in content-based image retrieval in recent years. However, few methods using the relevance ...
Deok-Hwan Kim, Chin-Wan Chung
WWW
2006
ACM
16 years 6 months ago
Discovering event evolution graphs from newswires
In this paper, we propose an approach to automatically mine event evolution graphs from newswires on the Web. Event evolution graph is a directed graph in which the vertices and e...
Christopher C. Yang, Xiaodong Shi
SEMWEB
2009
Springer
16 years 1 days ago
Scalable Distributed Reasoning Using MapReduce
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach o...
Jacopo Urbani, Spyros Kotoulas, Eyal Oren, Frank v...
141
Voted
ICIAP
2003
ACM
15 years 10 months ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
INFOCOM
2002
IEEE
15 years 10 months ago
On Distinguishing between Internet Power Law Topology Generators
— Recent work has shown that the node degree in the WWW induced graph and the AS-level Internet topology exhibit power laws. Since then several algorithms have been proposed to g...
Tian Bu, Donald F. Towsley