Sciweavers

406 search results - page 17 / 82
» Dominating Sets in Web Graphs
Sort
View
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
14 years 10 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
SWAT
1994
Springer
130views Algorithms» more  SWAT 1994»
14 years 1 months ago
Dominating Cliques in Distance-Hereditary Graphs
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
Feodor F. Dragan
WWW
2007
ACM
14 years 9 months ago
Towards efficient dominant relationship exploration of the product items on the web
In recent years, there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which ...
Zhenglu Yang, Lin Li, Botao Wang, Masaru Kitsurega...
EDBT
2009
ACM
96views Database» more  EDBT 2009»
14 years 3 months ago
Top-k dominant web services under multi-criteria matching
As we move from a Web of data to a Web of services, enhancing the capabilities of the current Web search engines with effective and efficient techniques for Web services retrieva...
Dimitrios Skoutas, Dimitris Sacharidis, Alkis Simi...
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
14 years 2 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer