Sciweavers

214 search results - page 5 / 43
» Computing the Closest Point to a Circle
Sort
View
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 6 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
COMPUTING
2006
102views more  COMPUTING 2006»
13 years 7 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 8 months ago
Closest-Point-of-Approach Join for Moving Object Histories
In applications that produce a large amount of data describing the paths of moving objects, there is a need to ask questions about the interaction of objects over a long recorded ...
Subramanian Arumugam, Chris Jermaine
EDBT
2009
ACM
92views Database» more  EDBT 2009»
13 years 11 months ago
Efficient skyline computation in metric space
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
David Fuhry, Ruoming Jin, Donghui Zhang
ICPR
2008
IEEE
14 years 1 months ago
The projective equation of a circle and its application in camera calibration
In this article, we present the projective equation of a circle in a perspective view, which naturally encodes such important geometric entities as the projected circle center, th...
Yinqiang Zheng, Yuncai Liu