Sciweavers

58 search results - page 3 / 12
» On distinct distances among points in general position and o...
Sort
View
ATAL
2009
Springer
13 years 12 months ago
User modeling in position auctions: re-considering the GSP and VCG mechanisms
We introduce a study of position auctions, with an explicit modeling of user navigation through ads. We refer to our model as the PPA model, since it is most applicable in the con...
Danny Kuminov, Moshe Tennenholtz
COMPGEOM
2008
ACM
13 years 7 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
PAMI
2002
201views more  PAMI 2002»
13 years 5 months ago
ICP Registration Using Invariant Features
This paper investigates the use of Euclidean invariant features in a generalization of iterative closest point registration of range images. Pointwisecorrespondences are chosen as...
Gregory C. Sharp, Sang Wook Lee, David K. Wehe
COMPGEOM
2004
ACM
13 years 10 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 5 months ago
The Plane-Width of Graphs
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
Marcin Kaminski, Paul Medvedev, Martin Milanic