Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Atish Das Sarma"'
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 27:1724-1738
Trust plays a crucial role in helping online users collect reliable information and it has gained increasing attention from the computer science community in recent years. Traditionally, research about online trust assumes static trust relations betw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b033d16cf9235374ff7b69da26739225
https://doi.org/10.1109/tkde.2014.2382576
https://doi.org/10.1109/tkde.2014.2382576
Publikováno v:
Distributed Computing. 28:309-320
Distance computation (e.g., computing shortest paths) is one of the most fundamental primitives used in communication networks. The cost of effectively and accurately computing pairwise network distances can become prohibitive in large-scale networks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10465b2c6d21dc37e22705c2f7f640a8
https://doi.org/10.1007/s00446-015-0246-7
https://doi.org/10.1007/s00446-015-0246-7
Publikováno v:
Theoretical Computer Science. 581:45-66
The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Random walks are a fundamental primitive in a wide variety of network applications; the local and li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::596f3c23fc477f2c7ea5d2b7152d2cdd
https://doi.org/10.1016/j.tcs.2015.02.044
https://doi.org/10.1016/j.tcs.2015.02.044
Publikováno v:
Journal of Parallel and Distributed Computing. 77:84-94
Performing random walks in networks is a fundamental primitive that has found numerous applications in communication networks such as token management, load balancing, network topology discovery and construction, search, and peer-to-peer membership m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::647edf710e71f99c2691d52dfeff104b
https://doi.org/10.1016/j.jpdc.2015.01.002
https://doi.org/10.1016/j.jpdc.2015.01.002
Publikováno v:
Proceedings of the VLDB Endowment. 6:1690-1701
Analysis of large graphs is critical to the ongoing growth of search engines and social networks. One class of queries centers around node affinity, often quantified by random-walk distances between node pairs, including hitting time, commute time, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5db13bb62e1ab4369aee0aad3fa8df4f
https://doi.org/10.14778/2556549.2556554
https://doi.org/10.14778/2556549.2556554
Publikováno v:
Journal of Graph Algorithms and Applications. 17:567-573
The celebrated Four-Color Theorem was rst conjectured in the 1850’s. Since then there had been many partial results. More than a century later, it was rst proved by Appel and Haken [1] and then subsequently improved by Robertson et al. [8]. These p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f426ac4ac2106b66680730b1ecc9a00
https://doi.org/10.7155/jgaa.00304
https://doi.org/10.7155/jgaa.00304
Publikováno v:
Proceedings of the VLDB Endowment. 3:1114-1124
We propose the k -representative regret minimization query ( k -regret) as an operation to support multi-criteria decision making. Like top- k , the k -regret query assumes that users have some utility or scoring functions; however, it never asks the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0dadfabdd5dd843f4e1046fc15d2df0
https://doi.org/10.14778/1920841.1920980
https://doi.org/10.14778/1920841.1920980
Publikováno v:
Proceedings of the VLDB Endowment. 2:85-96
We consider external algorithms for skyline computation without pre-processing. Our goal is to develop an algorithm with a good worst case guarantee while performing well on average. Due to the nature of disks, it is desirable that such algorithms ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6383adfdfc6254d0e1f30a2547b1e561
https://doi.org/10.14778/1687627.1687638
https://doi.org/10.14778/1687627.1687638
Publikováno v:
SIGMETRICS
Viral marketing is a powerful tool for online advertising and sales because it exploits the influence people have on one another. While this marketing technique has been beneficial for advertisers, it has not been shown how the social network provide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::308b09cc575ba31591da07ff94d714b9
https://doi.org/10.1145/2745844.2745853
https://doi.org/10.1145/2745844.2745853
Publikováno v:
ICDCN
A sparse cut of a graph is a partition of the vertices into two disjoint subsets such that the ratio of the number of edges across the two subsets divided by the sum of degrees of vertices in the smaller side is minimum. Finding sparse cuts is an imp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8c7e36c77a1122496ce6147d0e1670c
https://doi.org/10.1145/2684464.2684474
https://doi.org/10.1145/2684464.2684474