This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
teaching:mfe:is [2014/02/14 15:10] svsummer |
teaching:mfe:is [2014/02/14 15:15] svsummer |
||
|---|---|---|---|
| Line 109: | Line 109: | ||
| * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | ||
| + | |||
| + | ===== Efficient computation of simulation for structural indexing ===== | ||
| + | |||
| + | Simulation and bisimulation are fundamental notions in computer science. They underlie many formal verification algorithms, and have recently been applied to the construction of indexing data structures for relational databases and the semantic web. | ||
| + | |||
| + | Essentially, a simulation or bisimulation is a relation on the nodes | ||
| + | of a graph. Unfortunately, however, while efficient main-memory | ||
| + | algorithms for computing whether two nodes are simulating or bisimulating exist, these algorithms fail when no the input graphs are too large to fit in main memory. | ||
| + | |||
| + | The goal of this thesis is to study, compare, and implement various | ||
| + | approaches to computing simulation in an external memory setting, for | ||
| + | the explicit purpose of using the implementation to efficiently construct | ||
| + | simulation-based indexes for large relational databases and the | ||
| + | semantic web. | ||
| + | |||
| + | * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| ===== Aspects of Text Analytics and Information Extraction ===== | ===== Aspects of Text Analytics and Information Extraction ===== | ||
| Line 277: | Line 293: | ||
| * [[ezimanyi@ulb.ac.be|Esteban Zimányi]] (CoDE) | * [[ezimanyi@ulb.ac.be|Esteban Zimányi]] (CoDE) | ||
| - | |||