2004 search results - page 258 / 401 » Sampling from large graphs |
176
click to vote
OTM
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. The ongoing trend towards open data embraced by the Semantic Web has started to produce a large number of data sources. These data sources are published using RDF vocabul...
141
click to vote
PKDD
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
181
click to vote
PDP
2006
IEEE
16 years 9 days ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
154
click to vote
ICPADS
2005
IEEE
15 years 12 months ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
182
click to vote
SSDBM
2005
IEEE
15 years 12 months ago
2005
IEEE
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...