Srikanta Bedathur

Cituota

	Visi	Nuo 2018
Šaltiniai	2271	933
h-rodyklė	23	14
i10-rodyklė	47	29

200

100

150

2004200520062007200820092010201120122013201420152016201720182019202020212022202310 8 19 27 32 55 73 110 139 151 157 148 200 165 131 129 128 170 191 181

Viešas pasiekiamumas

Peržiūrėti viską

9 straipsniai

0 straipsnių

pasiekiami

nepasiekiami

Pagal finansavimo įpareigojimus

Bendraautoriai

Gerhard WeikumProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusPatvirtintas el. paštas mpi-inf.mpg.de
Klaus BerberichProfessor of Computer Science, Saarbruecken University of Applied Sciences (htw saar)Patvirtintas el. paštas htwsaar.de
Stephan SeufertAmazon ResearchPatvirtintas el. paštas steps.io
Avishek AnandAssociate Professor, TU Delft and L3S Research CenterPatvirtintas el. paštas tudelft.nl
Jayant HaritsaIndian Institute of SciencePatvirtintas el. paštas iisc.ac.in
Amitabha BagchiIndian Institute of Technology, DelhiPatvirtintas el. paštas cse.iitd.ac.in
Ralf SchenkelProfessor of Computer Science, Universitaet TrierPatvirtintas el. paštas uni-trier.de
Andrey GubichevGooglePatvirtintas el. paštas google.com
Omar AlonsoAmazonPatvirtintas el. paštas amazon.com
Maya RamanathAssistant Professor, Dept. of CSE, IIT-DelhiPatvirtintas el. paštas cse.iitd.ac.in
Thomas NeumannProfessor, Technische Universität MünchenPatvirtintas el. paštas in.tum.de
Nikos MamoulisUniversity of IoanninaPatvirtintas el. paštas cs.uoi.gr
Sameep MehtaIBM Research IndiaPatvirtintas el. paštas in.ibm.com
Michalis VazirgiannisDistinguished Professor, Ecole Polytechnique, Institute Polytechnique de ParisPatvirtintas el. paštas lix.polytechnique.fr
Christos TryfonopoulosUniversity of the PeloponnesePatvirtintas el. paštas uop.gr
Aparna VardeAssociate Professor of Computer Science, Montclair State UniversityPatvirtintas el. paštas montclair.edu
neha senguptaIIT DelhiPatvirtintas el. paštas cse.iitd.ac.in
Vinay SettyAssociate Professor, University of StavangerPatvirtintas el. paštas uis.no
Debajyoti BeraIIIT-DelhiPatvirtintas el. paštas iiitd.ac.in

Stebėti

Srikanta Bedathur

IIT Delhi

Patvirtintas el. paštas cse.iitd.ac.in - Pagrindinis puslapis

Databases Information Retrieval Data Mining


Pavadinimas Rūšiuoti pagal šaltinius Rūšiuoti pagal metus Rūšiuoti pagal pavadinimą	Cituota Cituota	Metai
Towards time-aware link prediction in evolving social networks T Tylenda, R Angelova, S Bedathur Proceedings of the 3rd workshop on social network mining and analysis, 1-10, 2009	299	2009
Fast and accurate estimation of shortest paths in large graphs A Gubichev, S Bedathur, S Seufert, G Weikum Proceedings of the 19th ACM international conference on Information and …, 2010	215	2010
A language modeling approach for temporal information needs K Berberich, S Bedathur, O Alonso, G Weikum Advances in Information Retrieval: 32nd European Conference on IR Research …, 2010	199	2010
Ferrari: Flexible and efficient reachability range assignment for graph indexing S Seufert, A Anand, S Bedathur, G Weikum 2013 IEEE 29th International Conference on Data Engineering (ICDE), 1009-1020, 2013	140	2013
A time machine for text search K Berberich, S Bedathur, T Neumann, G Weikum Proceedings of the 30th annual international ACM SIGIR conference on …, 2007	122	2007
Engineering a fast online persistent suffix tree construction SJ Bedathur, JR Haritsa Proceedings. 20th International Conference on Data Engineering, 720-731, 2004	75	2004
Sparqling kleene: fast property paths in RDF-3X A Gubichev, SJ Bedathur, S Seufert First International Workshop on Graph Data Management Experiences and …, 2013	63	2013
Bridging the Terminology Gap in Web Archive Search. K Berberich, SJ Bedathur, M Sozio, G Weikum WebDB, 2009	56	2009
Using word embeddings for information retrieval: How collection and term normalization choices affect performance D Roy, D Ganguly, S Bhatia, S Bedathur, M Mitra Proceedings of the 27th ACM international conference on information and …, 2018	52	2018
Time will tell: Leveraging temporal expressions in ir I Arikan, S Bedathur, K Berberich Second ACM International Conference on Web Search and Data Mining, 2009	45	2009
Durable top-k search in document archives U Leong Hou, N Mamoulis, K Berberich, S Bedathur Proceedings of the 2010 international conference on Management of data …, 2010	41	2010
Interesting-phrase mining for ad-hoc text analytics S Bedathur, K Berberich, J Dittrich, N Mamoulis, G Weikum Proceedings of the VLDB Endowment 3 (1-2), 1348-1357, 2010	40	2010
Efficiently answering regular simple path queries on large labeled networks S Wadhwa, A Prasad, S Ranu, A Bagchi, S Bedathur Proceedings of the 2019 international conference on management of data, 1463 …, 2019	35	2019
Temporal diversification of search results K Berberich, S Bedathur Proceedings of the SIGIR 2013 workshop on time-aware information access, 2013	35	2013
Incorporating terminology evolution for query translation in text retrieval with association rules AC Kaluarachchi, AS Varde, S Bedathur, G Weikum, J Peng, A Feldman Proceedings of the 19th ACM international conference on Information and …, 2010	35	2010
Computing n-gram statistics in MapReduce K Berberich, S Bedathur Proceedings of the 16th International Conference on Extending Database …, 2013	33	2013
Index maintenance for time-travel text search A Anand, S Bedathur, K Berberich, R Schenkel Proceedings of the 35th international ACM SIGIR conference on Research and …, 2012	33	2012
Efficient temporal keyword search over versioned text A Anand, S Bedathur, K Berberich, R Schenkel Proceedings of the 19th ACM international conference on Information and …, 2010	29	2010
Antourage: mining distance-constrained trips from flickr S Jain, S Seufert, S Bedathur Proceedings of the 19th international conference on World wide web, 1121-1122, 2010	29	2010
Arrow: Approximating reachability using random walks over web-scale graphs N Sengupta, A Bagchi, M Ramanath, S Bedathur 2019 IEEE 35th International Conference on Data Engineering (ICDE), 470-481, 2019	26	2019

Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.

Straipsniai 1–20

Šaltinių per metus

Dubliuoti šaltiniai

Sujungti šaltiniai

Pridėti bendraautoriusBendraautoriai

Stebėti

Cituota

Bendraautoriai