7913 search results - page 260 / 1583 » Information Collection on a Graph |
SIGIR
2008
ACM
15 years 19 days ago
2008
ACM
We describe the techniques developed to gather and distribute in a highly compressed, yet accessible, form a series of twelve snapshot of the .uk web domain. Ad hoc compression
SPIRE
2010
Springer
14 years 11 months ago
2010
Springer
This paper focuses on using hyperlinks in the ranking of web search results. We give a brief overview of the vast body of work in the area; we provide a quantitative comparison of ...
136
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
92
Voted
KBSE
1999
IEEE
15 years 5 months ago
1999
IEEE
Scenarios are valuable for supporting communication among system developers in the initial phases of requirements engineering. But the problem of how to fruitfully deal with large...
FLAIRS
2004
15 years 2 months ago
2004
Information quality assurance despite the existence of uncertainty about sources can be investigated in the context of soft security where an agent maintains trustworthiness evalu...