Sciweavers

609 search results - page 27 / 122
» Continuous Cube Mapping
Sort
View
NN
2000
Springer
145views Neural Networks» more  NN 2000»
15 years 25 days ago
Best approximation by Heaviside perceptron networks
In Lp-spaces with p [1, ) there exists a best approximation mapping to the set of functions computable by Heaviside perceptron networks with n hidden units; however for p (1, ) ...
Paul C. Kainen, Vera Kurková, Andrew Vogt
129
Voted
SECURWARE
2008
IEEE
15 years 7 months ago
A Body-Centered Cubic Method for Key Agreement in Dynamic Mobile Ad Hoc Networks
Mobile ad hoc networking is an operating mode for rapid mobile host interconnection, where nodes rely on each other, in order to maintain network connectivity and functionality. S...
Ioannis G. Askoxylakis, Damien Sauveron, Constanti...
113
Voted
VISUALIZATION
1997
IEEE
15 years 5 months ago
Multiresolution tetrahedral framework for visualizing regular volume data
We present a multiresolution framework, called Multi-Tetra framework, that approximates volume data with different levelsof-detail tetrahedra. The framework is generated through a...
Yong Zhou, Baoquan Chen, Arie E. Kaufman
JC
2007
94views more  JC 2007»
15 years 28 days ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
ICRA
2005
IEEE
88views Robotics» more  ICRA 2005»
15 years 6 months ago
Loop Closing in Topological Maps
— In order to create consistent maps of unknown environments, a robot must be able to recognize when it has returned to a previously visited place. In this paper, we introduce an...
Kristopher R. Beevers, Wesley H. Huang