Подписаться
Sebastian Michel
Sebastian Michel
Professor of Computer Science, RPTU Kaiserslautern-Landau
Подтвержден адрес электронной почты в домене cs.uni-kl.de - Главная страница
Название
Процитировано
Процитировано
Год
Klee: A framework for distributed top-k query algorithms
S Michel, P Triantafillou, G Weikum
Proceedings of the 31st international conference on Very large data bases …, 2005
3382005
Efficient top-k querying over social-tagging networks
R Schenkel, T Crecelius, M Kacimi, S Michel, T Neumann, JX Parreira, ...
Proceedings of the 31st annual international ACM SIGIR conference on …, 2008
2152008
Minerva: Collaborative p2p search
M Bender, S Michel, P Triantafillou, G Weikum, C Zimmer
Proceedings of the 31st international conference on Very large data bases …, 2005
1732005
Rankreduce–processing k-nearest neighbor queries on top of mapreduce
A Stupar, S Michel, R Schenkel
Large-Scale Distributed Systems for Information Retrieval 15, 3, 2010
1462010
Improving collection selection with overlap awareness in p2p search engines
M Bender, S Michel, P Triantafillou, G Weikum, C Zimmer
Proceedings of the 28th annual international ACM SIGIR conference on …, 2005
1442005
Exploiting social relations for query expansion and result ranking
M Bender, T Crecelius, M Kacimi, S Michel, T Neumann, JX Parreira, ...
2008 IEEE 24th International Conference on Data Engineering Workshop, 501-506, 2008
1182008
Distributed similarity search in high dimensions using locality sensitive hashing
P Haghani, S Michel, K Aberer
Proceedings of the 12th International Conference on Extending Database …, 2009
1172009
See what's enBlogue: real-time emergent topic identification in social media
F Alvanaki, S Michel, K Ramamritham, G Weikum
Proceedings of the 15th International Conference on Extending Database …, 2012
982012
Enblogue: emergent topic detection in web 2.0 streams
F Alvanaki, M Sebastian, K Ramamritham, G Weikum
Proceedings of the 2011 ACM SIGMOD International Conference on Management of …, 2011
832011
The ML-Index: A Multidimensional, Learned Index for Point, Range, and Nearest-Neighbor Queries.
A Davitkova, E Milchevski, S Michel
EDBT, 407-410, 2020
822020
Evaluating top-k queries over incomplete data streams
P Haghani, S Michel, K Aberer
Proceedings of the 18th ACM conference on Information and knowledge …, 2009
822009
p2pDating: Real life inspired semantic overlay networks for web search
JX Parreira, S Michel, G Weikum
Information Processing & Management 43 (3), 643-664, 2007
702007
Efficient and decentralized pagerank approximation in a peer-to-peer web search network
JX Parreira, D Donato, S Michel, G Weikum
Proceedings of the 32nd international conference on Very large data bases …, 2006
662006
The MINERVA project: Database selection in the context of P2P search
M Bender, S Michel, G Weikum, C Zimmer
Datenbanksysteme in Business, Technologie und Web, 11. Fachtagung des …, 2005
632005
P2P Content Search: Give the Web Back to the People.
M Bender, S Michel, P Triantafillou, G Weikum, C Zimmer
IPTPS, 2006
622006
The gist of everything new: personalized top-k processing over web 2.0 streams
P Haghani, S Michel, K Aberer
Proceedings of the 19th ACM international conference on Information and …, 2010
612010
Lsh at large-distributed knn search in high dimensions
P Haghani, S Michel, K Aberer
11th International Workshop on the Web and Databases, WebDB, 2008
572008
Peer-to-peer information search: Semantic, social, or spiritual?
M Bender, T Crecelius, M Kacimi, S Michel, JX Parreira, G Weikum
IEEE Data Eng. Bull. 30 (2), 51-60, 2007
552007
Discovering and exploiting keyword and attribute-value co-occurrences to improve P2P routing indices
S Michel, M Bender, N Ntarmos, P Triantafillou, G Weikum, C Zimmer
Proceedings of the 15th ACM international conference on Information and …, 2006
542006
Sensor metadata management and its application in collaborative environmental research
N Dawes, KA Kumar, S Michel, K Aberer, M Lehning
2008 IEEE Fourth International Conference on EScience, 143-150, 2008
532008
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20