64 search results - page 2 / 13 » Geometric Searching over the Rationals |
SMI
2005
IEEE
13 years 10 months ago
2005
IEEE
Traditional approaches for modeling a closed manifold surface with either regular tensor-product or triangular splines (defined over an open planar domain) require decomposing th...
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
ATAL
2003
Springer
13 years 10 months ago
2003
Springer
Agent theories and agent programs are two very different styles of specification of agent behavior. The former are declarative in nature, while the latter have an imperative fl...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...