Sciweavers

4865 search results - page 667 / 973
» The Complexity of Graph Connectivity
Sort
View
CORR
2007
Springer
144views Education» more  CORR 2007»
15 years 5 months ago
Distributing the Kalman Filter for Large-Scale Systems
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
Usman A. Khan, José M. F. Moura
ADHOC
2005
102views more  ADHOC 2005»
15 years 5 months ago
Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
Julien Cartigny, François Ingelrest, David ...
SMA
2008
ACM
173views Solid Modeling» more  SMA 2008»
15 years 5 months ago
Visibility-based feature extraction from discrete models
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
Antoni Chica
135
Voted
BC
2005
106views more  BC 2005»
15 years 5 months ago
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
Abstract We model the dynamical behavior of the neuropil, the densely interconnected neural tissue in the cortex, using neuropercolation approach. Neuropercolation generalizes phas...
Robert Kozma, Marko Puljic, Paul Balister, B&eacut...
143
Voted
JEI
2007
144views more  JEI 2007»
15 years 5 months ago
Cost-based closed-contour representations
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
Angel Domingo Sappa, Boris Xavier Vintimilla