Results 1  10
of
522
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 718 (5 self)
 Add to MetaCart
to the minimization strategy. We enumerate and classify many of these variants, and evaluate their effect on the speed with which the correct alignment is reached. In order to improve convergence for nearlyflat meshes with small features, such as inscribed surfaces, we introduce a new variant based on uniform
On MaximumLikelihood Detection and the Search for the Closest Lattice Point
 IEEE TRANS. INFORM. THEORY
, 2003
"... Maximumlikelihood (ML) decoding algorithms for Gaussian multipleinput multipleoutput (MIMO) linear channels are considered. Linearity over the field of real numbers facilitates the design of ML decoders using numbertheoretic tools for searching the closest lattice point. These decoders are colle ..."
Abstract

Cited by 273 (9 self)
 Add to MetaCart
are collectively referred to as sphere decoders in the literature. In this paper, a fresh look at this class of decoding algorithms is taken. In particular, two novel algorithms are developed. The first algorithm is inspired by the Pohst enumeration strategy and is shown to offer a significant reduction
Closest Point Search in Lattices
 IEEE TRANS. INFORM. THEORY
, 2000
"... In this semitutorial paper, a comprehensive survey of closestpoint search methods for lattices without a regular structure is presented. The existing search strategies are described in a unified framework, and differences between them are elucidated. An efficient closestpoint search algorithm, ba ..."
Abstract

Cited by 333 (2 self)
 Add to MetaCart
In this semitutorial paper, a comprehensive survey of closestpoint search methods for lattices without a regular structure is presented. The existing search strategies are described in a unified framework, and differences between them are elucidated. An efficient closestpoint search algorithm
Query Optimization for XML
 In Proceedings of VLDB
, 1999
"... XML is an emerging standard for data representation and exchange on the WorldWide Web. Due to the nature of information on the Web and the inherent flexibility of XML, we expect that much of the data encoded in XML will be semistructured:the data may be irregular or incomplete, and its structu ..."
Abstract

Cited by 208 (3 self)
 Add to MetaCart
apply to XMLbased query languages, a number of additional problems arise, such as new kinds of indexing, more complicated notions of database statistics, and vastly different query execution strategies for different databases. We define appropriate logical and physical query plans, database
Effective Strategies for Enumeration Games
 Proceedings of Computer Science Logic CSL '95
, 1996
"... We study the existence of effective winning strategies in certain infinite games, so called enumeration games. Originally, these were introduced by Lachlan (1970) in his study of the lattice of recursively enumerable sets. We argue that they provide a general and interesting framework for computable ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We study the existence of effective winning strategies in certain infinite games, so called enumeration games. Originally, these were introduced by Lachlan (1970) in his study of the lattice of recursively enumerable sets. We argue that they provide a general and interesting framework
Symbolic Controller Synthesis for Discrete and Timed Systems
 Hybrid Systems II, LNCS 999
, 1995
"... . This paper presents algorithms for the symbolic synthesis of discrete and realtime controllers. At the semantic level the controller is synthesized by finding a winning strategy for certain games defined by automata or by timedautomata. The algorithms for finding such strategies need, this way o ..."
Abstract

Cited by 133 (16 self)
 Add to MetaCart
. This paper presents algorithms for the symbolic synthesis of discrete and realtime controllers. At the semantic level the controller is synthesized by finding a winning strategy for certain games defined by automata or by timedautomata. The algorithms for finding such strategies need, this way
Crowdsourced Enumeration Queries
"... Abstract — Hybrid human/computer database systems promise to greatly expand the usefulness of query processing by incorporating the crowd for data gathering and other tasks. Such systems raise many implementation questions. Perhaps the most fundamental question is that the closed world assumption un ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
in crowdsourcing systems. To address these issues, we develop statistical tools that enable users and systems developers to reason about query completeness. These tools can also help drive query execution and crowdsourcing strategies. We evaluate our techniques using experiments on a popular crowdsourcing platform
Hybrid enumeration strategies for mixed integer programming
, 2004
"... In this paper we present several algorithms which combine a partial enumeration with metaheuristics for the solution of general mixedinteger programming problems. The enumeration is based on the primal values assignable to the integer variables of the problem. We develop some algorithms for this i ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we present several algorithms which combine a partial enumeration with metaheuristics for the solution of general mixedinteger programming problems. The enumeration is based on the primal values assignable to the integer variables of the problem. We develop some algorithms
Approximate verification and enumeration problems
"... We study enumeration problems with probabilistic methods and apply them to verification problems. We consider the enumeration of monomials of a polynomial given as a black box, and the enumeration of discrete points which separate two polytopes in a space of dimension n, using a random walk which p ..."
Abstract
 Add to MetaCart
nondeterministic finite automata using an embedding in a vector space of dimension p, in time polynomial in p. We also enumerate strategies which εdistinguish two Markov Decision Processes in time polynomial in the dimension of their statistical representation. I.
Results 1  10
of
522