20441 search results - page 363 / 4089 » Locally Computable Structures |
142
click to vote
ALENEX
2003
15 years 7 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
140
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
We present a novel systematic method to obtain componentwise ultimate bounds in perturbed sampled-data systems, especially when the perturbations arise due to quantization. The pr...
166
click to vote
ISBI
2009
IEEE
16 years 25 days ago
2009
IEEE
Recent improvements of fetal MRI acquisitions now allow threedimensional segmentation of fetal structures, to extract biometrical measures for pregnancy follow-up. Automation of t...
144
click to vote
CDC
2008
IEEE
16 years 15 days ago
2008
IEEE
— In this paper an approach to reduce nonlinear non-observable and non-strongly accessible port-Hamiltonian systems to an observable and strongly accessible portHamiltonian syste...
169
click to vote
PIMRC
2008
IEEE
16 years 12 days ago
2008
IEEE
—In this paper, we propose a new control method to cover “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are dis...