Sciweavers

239 search results - page 31 / 48
» The Parameterized Complexity of Global Constraints
Sort
View
IJRR
2007
104views more  IJRR 2007»
13 years 8 months ago
Deep Space Formation Flying Spacecraft Path Planning
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...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
SI3D
2005
ACM
14 years 2 months ago
Texture sprites: texture elements splatted on surfaces
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 ...
Sylvain Lefebvre, Samuel Hornus, Fabrice Neyret
ECCV
2006
Springer
14 years 10 months ago
Carved Visual Hulls for Image-Based Modeling
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...
Yasutaka Furukawa, Jean Ponce
NIPS
2003
13 years 10 months ago
Minimax Embeddings
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...
Matthew Brand
ICC
2007
IEEE
170views Communications» more  ICC 2007»
14 years 3 months ago
Evaluating Techniques for Network Layer Independence in Cognitive Networks
— 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...
Muthukumaran Pitchaimani, Benjamin J. Ewy, Joseph ...