239 search results - page 31 / 48 » The Parameterized Complexity of Global Constraints |
IJRR
2007
14 years 11 months ago
2007
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
105
click to vote
SI3D
2005
ACM
15 years 5 months ago
2005
ACM
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...
101
click to vote
NIPS
2003
15 years 1 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Cognitive networks are the latest progression of cognitive functionality into the networking stack, an effort which began with a layer one and two focus on cognitive radios, an...