64 search results - page 4 / 13 » Geometric Searching over the Rationals |
ICMCS
2005
IEEE
14 years 3 months ago
2005
IEEE
Random geometric distortion is one of the most difficult kinds of image processing to survive and has been a noted problem in watermarking research. Previous methods for dealing ...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
FROCOS
2011
Springer
12 years 9 months ago
2011
Springer
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...