406 search results - page 57 / 82 » Dominating Sets in Web Graphs |
ISAAC
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
SEMWEB
2009
Springer
14 years 3 months ago
2009
Springer
Linked open data offers a set of design patterns and conventions for sharing data across the semantic web. In this position paper we enumerate some key uncertainty representation i...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Dataspace applications necessitate the creation of associations among data items over time. For example, once information about people is extracted from sources on the Web, associa...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...