Sciweavers

186 search results - page 37 / 38
» Improved approximation algorithms for directed Steiner fores...
Sort
View
GIS
2003
ACM
14 years 17 days ago
Construction of the planar partition postal code map based on cadastral reGIStration
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 ...
FSTTCS
2009
Springer
14 years 1 months ago
Kernels for Feedback Arc Set In Tournaments
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...
Stéphane Bessy, Fedor V. Fomin, Serge Gaspe...
SIGGRAPH
2000
ACM
13 years 11 months ago
Illuminating micro geometry based on precomputed visibility
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-...
VLDB
1999
ACM
140views Database» more  VLDB 1999»
13 years 11 months ago
Combining Histograms and Parametric Curve Fitting for Feedback-Driven Query Result-size Estimation
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...
Arnd Christian König, Gerhard Weikum
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 11 months ago
Fast query execution for retrieval models based on path-constrained random walks
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...
Ni Lao, William W. Cohen