Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Nemirovsky, Danil"'
Autor:
Nemirovsky, Danil
Bitcoin, a decentralized cryptocurrency, has attracted a lot of attention from academia, financial service industry and enthusiasts. The trade-off between transaction confirmation throughput and centralization of hash power do not allow Bitcoin to pe
Externí odkaz:
http://arxiv.org/abs/1512.08626
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and name disambiguation. In particular, we a
Externí odkaz:
http://arxiv.org/abs/1008.3775
Random walk can be used as a centrality measure of a directed graph. However, if the graph is reducible the random walk will be absorbed in some subset of nodes and will never visit the rest of the graph. In Google PageRank the problem was solved by
Externí odkaz:
http://arxiv.org/abs/0708.0522
Autor:
Nemirovsky, Danil
Publikováno v:
In Linear Algebra and Its Applications 15 February 2013 438(4):1900-1922
Publikováno v:
In Journal of Computational and Applied Mathematics 2010 234(11):3075-3090
Autor:
Avrachenkov, Konstantin, Litvak, Nelly, Nemirovsky, Danil, Smirnova, Elena, Sokol, Marina, Frieze, Alan, Horn, Paul, Pralat, Pawel
Publikováno v:
Algorithms and Models for the Web Graph: 8th International Workshop, WAW 2011, Atlanta, GA, USA, May 27-29, 2011. Proceedings, 50-61
STARTPAGE=50;ENDPAGE=61;TITLE=Algorithms and Models for the Web Graph
Lecture Notes in Computer Science ISBN: 9783642212857
WAW
STARTPAGE=50;ENDPAGE=61;TITLE=Algorithms and Models for the Web Graph
Lecture Notes in Computer Science ISBN: 9783642212857
WAW
We study a problem of quick detection of top-k Personalized PageRank (PPR) lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and person name disambiguation. We arg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97f758007bdff1d67df289df26b6efca
https://doi.org/10.1007/978-3-642-21286-4_5
https://doi.org/10.1007/978-3-642-21286-4_5
Autor:
Nemirovsky, Danil
Publikováno v:
[Research Report] RR-7072, INRIA. 2009
Moments of absorbing Markov chain are considered. First moments and non-mixed second moments are determined in classical textbooks such as the book of J. Kemeny and J. Snell ``Finite Markov Chains''. The reason is that the first moments and the non-m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::9db18dac1b18ba53c7dfc4d6ed3f98e7
https://inria.hal.science/inria-00426763v2/document
https://inria.hal.science/inria-00426763v2/document
Publikováno v:
Proceedings of the 2nd International Conference: Performance Evaluation Methodologies & Tools; 10/22/2007, p1-9, 9p
Autor:
Avrachenkov, Konstantin, Dobrynin, Vladimir, Nemirovsky, Danil, Pham, Son Kim, Smirnova, Elena
Publikováno v:
Proceedings of the 31st Annual International ACM SIGIR Conference: Research & Development in Information Retrieval; 7/20/2008, p873-874, 2p
Publikováno v:
ACM International Conference Proceeding Series; Oct2006, p54-es, 1p