Следене
Srikanta Bedathur
Srikanta Bedathur
IIT Delhi
Потвърден имейл адрес: cse.iitd.ac.in - Начална страница
Заглавие
Позовавания
Позовавания
Година
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
3102009
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
2362010
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
2032010
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
1552013
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
1292007
Engineering a fast online persistent suffix tree construction
SJ Bedathur, JR Haritsa
Proceedings. 20th International Conference on Data Engineering, 720-731, 2004
762004
Sparqling kleene: fast property paths in RDF-3X
A Gubichev, SJ Bedathur, S Seufert
First International Workshop on Graph Data Management Experiences and …, 2013
662013
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
602018
Bridging the Terminology Gap in Web Archive Search.
K Berberich, SJ Bedathur, M Sozio, G Weikum
WebDB, 2009
552009
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
462009
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
442019
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
432010
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
412010
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
392010
Temporal diversification of search results
K Berberich, S Bedathur
SIGIR 2013 Workshop on Time-aware Information Access, 2013
372013
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
372012
Computing n-gram statistics in MapReduce
K Berberich, S Bedathur
Proceedings of the 16th International Conference on Extending Database …, 2013
362013
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
352010
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
322019
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
312010
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20