Sciweavers

5473 search results - page 634 / 1095
» On the graph isomorphism problem
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
16 years 8 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
SIGIR
2005
ACM
16 years 13 days ago
Exploiting the hierarchical structure for link analysis
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hiera...
Gui-Rong Xue, Qiang Yang, Hua-Jun Zeng, Yong Yu, Z...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 11 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
RANDOM
1998
Springer
15 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
CONEXT
2008
ACM
15 years 8 months ago
Online estimation of RF interference
Increased AP density in enterprise WLANs leads to increasing RF interference and decreasing performance. An important step towards mitigating this problem is to construct precise ...
Nabeel Ahmed, Usman Ismail, Srinivasan Keshav, Kon...