44 search results - page 8 / 9 » Highly scalable algorithm for distributed real-time text ind... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
SIGIR
2009
ACM
14 years 1 months ago
2009
ACM
The selection of indexing terms for representing documents is a key decision that limits how effective subsequent retrieval can be. Often stemming algorithms are used to normaliz...
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
In social media, such as blogs, since the content naturally evolves over time, it is hard or in many cases impossible to organize the content for effective navigation. Thus, one c...
TKDE
2011
13 years 1 months ago
2011
—The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly en...
CIKM
2011
Springer
12 years 6 months ago
2011
Springer
In most of the cases, scientists depend on previous literature which is relevant to their research fields for developing new ideas. However, it is not wise, nor possible, to trac...