VAN DEN BUSSCHE, Jan

Email Alert RSS Feed

Profile

Full Name
VAN DEN BUSSCHE, Jan
Email
jan.vandenbussche@uhasselt.be
 
Loading... 5 0 5 0 false
Loading... 6 0 5 0 false

Publications

Refined By:
Author:  GEERTS, Floris

Results 1-15 of 15 (Search time: 0.007 seconds).

Issue DateTitleContributor(s)TypeCat.
12022On the Expressive Power of Message-Passing Neural Networks as Global Feature Map TransformersGEERTS, Floris; STEEGMANS, Jasper; VAN DEN BUSSCHE, JanProceedings PaperC1
22021Matrix Query LanguagesGEERTS, Floris; Munoz, Thomas; Riveros, Cristian; VAN DEN BUSSCHE, Jan; Vrgoc, DomagojJournal ContributionA1
32019On the Expressive Power of Query Languages for MatricesBRIJDER, Robert; GEERTS, Floris; VAN DEN BUSSCHE, Jan; WEERWAG, TimmyJournal ContributionA1
42019MATLANG: Matrix operations and their expressive powerBRIJDER, Robert; GEERTS, Floris; VAN DEN BUSSCHE, Jan; WEERWAG, TimmyJournal ContributionA1
52018On the expressive power of query languages for matricesBRIJDER, Robert; GEERTS, Floris; VAN DEN BUSSCHE, Jan; WEERWAG, TimmyProceedings PaperC1
62011Relational completeness of query languages for annotated databasesGEERTS, Floris; VAN DEN BUSSCHE, JanJournal ContributionA1
72007Relational completeness of query languages for annotated databasesGEERTS, Floris; VAN DEN BUSSCHE, JanJournal ContributionA1
82007Relational completeness of query languages for annotated databasesGEERTS, Floris; VAN DEN BUSSCHE, JanProceedings PaperC1
92006On-line maintenance of simplified weighted graphs for efficient distance queriesGEERTS, Floris; REVESZ, Peter; VAN DEN BUSSCHE, JanProceedings PaperC1
102006Linearization and completeness results for terminating transitive closure queries on spatial databasesGEERTS, Floris; KUIJPERS, Bart; VAN DEN BUSSCHE, JanJournal ContributionA1
112005Tight upper bounds on the number of candidate patternsGEERTS, Floris; GOETHALS, Bart; VAN DEN BUSSCHE, JanJournal ContributionA1
122004N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic setsGEERTS, Floris; Smits, Lieven; VAN DEN BUSSCHE, JanJournal ContributionA1
132001A Tight Upper Bound on the Number of Candidate PatternsGEERTS, Floris; GOETHALS, Bart; VAN DEN BUSSCHE, JanProceedings PaperC1
142000Efficient on-line topological simplification of network-like dataGEERTS, Floris; REVESZ, Peter; VAN DEN BUSSCHE, JanPreprintO
151999Topological canonization of planar spatial data and its incremental maintenanceGEERTS, Floris; KUIJPERS, Bart; VAN DEN BUSSCHE, JanProceedings Paper