Accurate postal code maps have many applications within GIS as the postal code has the potential to link the address description of buildings to their location in a specified glob...
Friso Penninga, Edward Verbree, Wilko Quak, Peter ...
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
Many researchers have been arguing that geometry, bump maps, and BRDFs present a hierarchy of detail that should be exploited for efficient rendering purposes. In practice howeve...
Wolfgang Heidrich, Katja Daubert, Jan Kautz, Hans-...
This paper aims to improve the accuracy of query result-size estimations in query optimizers by leveraging the dynamic feedback obtained from observations on the executed query wo...
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...