5 citations · 8 across the 2 of their papers we have counts for
3 papers
cs.DS2021★ 3 cited
Improving The Floyd-Warshall All Pairs Shortest Paths Algorithm
Ismail H. Toroslu
The Floyd-Warshall algorithm is the most popular algorithm for determining the shortest paths between all pairs in a graph. It is very a simple and an elegant algorithm. However, i…
cs.DB2018
Graph Based Proactive Secure Decomposition Algorithm for Context Dependent Attribute Based Inference Control Problem
Ugur Turan, Ismail H. Toroslu, Murat Kantarcioglu
Relational DBMSs continue to dominate the database market, and inference problem on external schema of relational DBMS's is still an important issue in terms of data privacy.Especi…
cs.DB2008★ 5 cited
Discovering More Accurate Frequent Web Usage Patterns
Murat Ali Bayir, Ismail Hakki Toroslu, Ahmet Cosar +1
Web usage mining is a type of web mining, which exploits data mining techniques to discover valuable information from navigation behavior of World Wide Web users. As in classical d…