Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Liren Shan"'
Autor:
Konstantin Makarychev, Liren Shan
Publikováno v:
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85de65e6b10a525aedc681e1b5a7610b
https://doi.org/10.1145/3519935.3520056
https://doi.org/10.1145/3519935.3520056
This paper looks at a common law legal system as a learning algorithm, models specific features of legal proceedings, and asks whether this system learns efficiently. A particular feature of our model is explicitly viewing various aspects of court pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2be38ed1fdf1d32b61818ca1e8b5338a
This paper introduces an objective for optimizing proper scoring rules. The objective is to maximize the increase in payoff of a forecaster who exerts a binary level of effort to refine a posterior belief from a prior belief. In this framework we cha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::109bc3dd17e06ccb8a83dc52fcf69b6c
This paper studies algorithmic strategies to effectively reduce the number of infections in susceptible-infected-recovered (SIR) epidemic models. We consider a Markov chain SIR model and its two instantiations in the deterministic SIR (D-SIR) model a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1872f4a1ae0ecad944b200eae0bd023
Publikováno v:
Theoretical Computer Science. 720:47-54
As a fundamental subject of theoretical computer science, the maximum independent set (MIS) problem not only is of purely theoretical interest, but also has found wide applications in various fields. However, for a general graph determining the size
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::899917bf86bf8552cf5bcbdea198b7d8
https://doi.org/10.1016/j.tcs.2018.02.022
https://doi.org/10.1016/j.tcs.2018.02.022
Publikováno v:
IEEE Transactions on Control Systems Technology. 25:342-350
In this brief, we study first- and second-order consensus algorithms for the scale-free small-world Koch network, where vertices are subject to white noise. We focus on three cases of consensus schemes: 1) first-order leaderless algorithm; 2) first-o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0caef53c52172caed518364f2474f058
https://doi.org/10.1109/tcst.2016.2550582
https://doi.org/10.1109/tcst.2016.2550582
Publikováno v:
WWW
Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to a group of vertices in a weighted graph, and then study the problem o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1eb0bb53b361cf712ec594d545680c51
https://doi.org/10.1145/3308558.3313490
https://doi.org/10.1145/3308558.3313490
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpi\'nski graph
The minimum dominating set (MDS) problem is a fundamental subject of theoretical computer science, and has found vast applications in different areas, including sensor networks, protein interaction networks, and structural controllability. However, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35b7404ddbbda413a108f1fdd27459a4
http://arxiv.org/abs/1703.09023
http://arxiv.org/abs/1703.09023
Publikováno v:
Scopus-Elsevier
IJCAI
IJCAI
The problem of increasing the centrality of a network node arises in many practical applications. In this paper, we study the optimization problem of maximizing the information centrality $I_v$ of a given node $v$ in a network with $n$ nodes and $m$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7dd8dc7f953c9a1be35bed031b7dc468
http://www.scopus.com/inward/record.url?eid=2-s2.0-85055703898&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-85055703898&partnerID=MN8TOARS
Publikováno v:
Scopus-Elsevier
IJCAI
IJCAI
The Kirchhoff index, defined as the sum of effective resistances over pairs all of nodes, is of primary significance in diverse contexts of complex networks. In this paper, we propose to use the rate at which the Kirchhoff index changes with respect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73c00d0c0435189b1c80787eba16dab5
http://www.scopus.com/inward/record.url?eid=2-s2.0-85055725309&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-85055725309&partnerID=MN8TOARS