794 search results - page 59 / 159 » Improved algorithms for orienteering and related problems |
136
click to vote
GLVLSI
2009
IEEE
16 years 26 days ago
2009
IEEE
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techni...
149
click to vote
CG
2007
Springer
15 years 6 months ago
2007
Springer
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...
162
click to vote
ICIP
2003
IEEE
16 years 7 months ago
2003
IEEE
Robust registration of two 3-D point sets is a common problem in computer vision. The Iterative Closest Point (ICP) algorithm is undoubtedly the most popular algorithm for solving...
155
click to vote
AAAI
2010
15 years 7 months ago
2010
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
169
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...