Sciweavers

2693 search results - page 146 / 539
» On Computing Complex Navigation Functions
Sort
View
PPL
2010
118views more  PPL 2010»
15 years 4 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl
SIGGRAPH
1987
ACM
15 years 10 months ago
Flocks, herds and schools: A distributed behavioral model
The aggregate motion of a flock of birds, a herd of land animals, or a school of fish is a beautiful and familiar part of the natural world. But this type of complex motion is rar...
Craig W. Reynolds
ECCV
2004
Springer
16 years 8 months ago
Multiple View Feature Descriptors from Image Sequences via Kernel Principal Component Analysis
Abstract. We present a method for learning feature descriptors using multiple images, motivated by the problems of mobile robot navigation and localization. The technique uses the ...
Jason Meltzer, Ming-Hsuan Yang, Rakesh Gupta, Stef...
CHI
2009
ACM
16 years 7 months ago
Dying, death, and mortality: towards thanatosensitivity in HCI
What happens to human-computer "interaction" when the human user is no longer alive? This exploratory paper uses insights from the critical humanist tradition to argue f...
Michael Massimi, Andrea Charise
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 11 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick