Sciweavers

6740 search results - page 356 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
CG
2007
Springer
15 years 4 months ago
Graphtracker: A topology projection invariant optical tracker
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
Ferdi A. Smit, Arjen van Rhijn, Robert van Liere
CVPR
1999
IEEE
16 years 6 months ago
A Novel Bayesian Method for Fitting Parametric and Non-Parametric Models to Noisy Data
We o er a simple paradigm for tting models, parametric and non-parametric, to noisy data, which resolves some of the problems associated with classic MSE algorithms. This is done ...
Michael Werman, Daniel Keren
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
15 years 5 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
PODC
2011
ACM
14 years 7 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
CL
2012
Springer
13 years 7 months ago
Object swapping challenges: An evaluation of imageSegment
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
Mariano Martinez Peck, Noury Bouraqadi, Sté...