Sciweavers

36 search results - page 3 / 8
» Visiting a Polygon on the Optimal Way to a Query Point
Sort
View
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
13 years 10 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
CGF
2008
126views more  CGF 2008»
13 years 5 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
11 years 7 months ago
Web image prediction using multivariate point processes
In this paper, we investigate a problem of predicting what images are likely to appear on the Web at a future time point, given a query word and a database of historical image str...
Gunhee Kim, Fei-Fei Li, Eric P. Xing
PPDP
2010
Springer
13 years 3 months ago
Deriving predicate statistics in datalog
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
Senlin Liang, Michael Kifer
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 6 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson