Sciweavers

140 search results - page 23 / 28
» An efficient algorithm to rank Web resources
Sort
View
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 25 days ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
WWW
2005
ACM
14 years 8 months ago
Gimme' the context: context-driven automatic semantic annotation with C-PANKOW
Without the proliferation of formal semantic annotations, the Semantic Web is certainly doomed to failure. In earlier work we presented a new paradigm to avoid this: the 'Sel...
Günter Ladwig, Philipp Cimiano, Steffen Staab
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 2 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 7 months ago
Query biased snippet generation in XML search
Snippets are used by almost every text search engine to complement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance ...
Yu Huang, Ziyang Liu, Yi Chen
MM
2006
ACM
167views Multimedia» more  MM 2006»
14 years 1 months ago
Image annotation by large-scale content-based image retrieval
Image annotation has been an active research topic in recent years due to its potentially large impact on both image understanding and Web image search. In this paper, we target a...
Xirong Li, Le Chen, Lei Zhang, Fuzong Lin, Wei-Yin...