| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Floris Geerts Floris Geerts, Anastasios Kementsietsidis , Diego Milano : i MONDRIAN: A Visual Tool to Annotate and Query Scientific Databases. EDBT 2006 : 1168-1171 Floris Geerts, Anastasios Kementsietsidis , Diego Milano : MONDRIAN: Annotating and Querying Databases through Colors and Blocks. ICDE 2006 : 82 Floris Geerts, Bart Kuijpers , Jan Van den Bussche : Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases. SIAM J. Comput. 35 (6): 1386-1439 (2006) Floris Geerts, Wenfei Fan : Satisfiability of XPath Queries with Sibling Axes. DBPL 2005 : 122-137 Michael Benedikt , Wenfei Fan , Floris Geerts: XPath satisfiability in the presence of DTDs. PODS 2005 : 25-36 Floris Geerts, Bart Goethals , Jan Van den Bussche : Tight upper bounds on the number of candidate patterns. ACM Trans. Database Syst. 30 (2): 333-363 (2005) Floris Geerts, Lieven Smits , Jan Van den Bussche : N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets. Acta Inf. 42 (1): 43-56 (2005) Floris Geerts, Bart Kuijpers : On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases. Theor. Comput. Sci. 336 (1): 125-151 (2005) Floris Geerts: Moving Objects and Their Equations of Motion. CDB 2004 : 41-52 Floris Geerts, Bart Goethals , Taneli Mielikäinen : Tiling Databases. Discovery Science 2004 : 278-289 Lauri Eronen , Floris Geerts, Hannu Toivonen : A Markov Chain Approach to Reconstruction of Long Haplotypes. Pacific Symposium on Biocomputing 2004 : 104-115 Floris Geerts, Heikki Mannila , Evimaria Terzi : Relational link-based ranking. VLDB 2004 : 552-563 Floris Geerts: Frequent Knot Discovery CoRR cs.DB/0410038 : (2004) Floris Geerts, Bart Kuijpers : Topological formulation of termination properties of iterates of functions. Inf. Process. Lett. 89 (1): 31-35 (2004) Floris Geerts, Bart Kuijpers : Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases. ICDT 2003 : 190-206 Floris Geerts, Bart Goethals , Taneli Mielikäinen : What You Store is What You Get. KDID 2003 : 60-69 Floris Geerts, Lieven Smits , Jan Van den Bussche : Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets CoRR cs.LO/0308001 : (2003) Floris Geerts: Expressing the box cone radius in the relational calculus with real polynomial constraints. Discrete & Computational Geometry 30 (4): 607-622 (2003) Floris Geerts: Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension. DBPL 2001 : 182-197 Floris Geerts, Sofie Haesevoets , Bart Kuijpers : A Theory of Spatio-Temporal Database Queries. DBPL 2001 : 198-212 Floris Geerts, Bart Goethals , Jan Van den Bussche : A Tight Upper Bound on the Number of Candidate Patterns. ICDM 2001 : 155-162 Floris Geerts: Expressing the cone radius in the relational calculus with real polynomial constraints CoRR cs.DB/0106046 : (2001) Floris Geerts, Bart Goethals , Jan Van den Bussche : A Tight Upper Bound on the Number of Candidate Patterns CoRR cs.DB/0112007 : (2001) Floris Geerts, Bart Kuijpers : Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic. PODS 2000 : 126-135 Floris Geerts, Bart Kuijpers : Expressing Topological Connectivity of Spatial Databases. DBPL 1999 : 224-238 Floris Geerts, Chris Blondia : Superposition of Markov sources and long range dependence. Broadband Communications 1998 : 550-562 Floris Geerts, Bart Kuijpers , Jan Van den Bussche : Topological Canonization of Planar Spatial Data and Its Incremental Maintenance. FMLDO 1998 : 55-67 Chris Blondia , Floris Geerts: The Correlation Structure of the Output of an ATM Multiplexer. Modelling and Evaluation of ATM Networks 1997 : 235-250 1 [ 24 ] 2 [ 1 ] [ 3 ] 3 [ 2 ] [ 6 ] [ 8 ] [ 12 ] [ 22 ] [ 23 ] [ 26 ] 4 [ 18 ] 5 [ 24 ] [ 25 ] 6 [ 6 ] [ 8 ] [ 13 ] [ 19 ] [ 23 ] 7 [ 9 ] 8 [ 27 ] [ 28 ] 9 [ 2 ] [ 4 ] [ 5 ] [ 9 ] [ 14 ] [ 15 ] [ 21 ] [ 26 ] 10 [ 17 ] 11 [ 13 ] [ 19 ] 12 [ 27 ] [ 28 ] 13 [ 12 ] [ 22 ] 14 [ 17 ] 15 [ 18 ]  ©2006 Association for Computing Machinery |
