Sciweavers

95 search results - page 14 / 19
» General neighbour-distinguishing index of a graph
Sort
View
WWW
2005
ACM
14 years 8 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
DAM
2010
116views more  DAM 2010»
13 years 7 months ago
Minimum sum edge colorings of multicycles
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-...
MM
2010
ACM
151views Multimedia» more  MM 2010»
13 years 8 months ago
Explicit and implicit concept-based video retrieval with bipartite graph propagation model
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
Lei Bao, Juan Cao, Yongdong Zhang, Jintao Li, Ming...
HT
2003
ACM
14 years 1 months ago
The connectivity sonar: detecting site functionality by structural patterns
Web sites today serve many different functions, such as corporate sites, search engines, e-stores, and so forth. As sites are created for different purposes, their structure and...
Einat Amitay, David Carmel, Adam Darlow, Ronny Lem...
I3
2007
13 years 9 months ago
Performing Object Consolidation on the Semantic Web Data Graph
An important aspect of Semantic Web technologies is the issue of identity and uniquely identifying resources, which is essential for integrating data across sources. Currently, th...
Aidan Hogan, Andreas Harth, Stefan Decker