Results 1  10
of
6,375
Consensus Problems in Networks of Agents with Switching Topology and TimeDelays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader ..."
Abstract

Cited by 1112 (21 self)
 Add to MetaCart
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or
A Signal Processing Approach To Fair Surface Design
, 1995
"... In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing, or fai ..."
Abstract

Cited by 654 (15 self)
 Add to MetaCart
, or fairing, to lowpass filtering. We describe a very simple surface signal lowpass filter algorithm that applies to surfaces of arbitrary topology. As opposed to other existing optimizationbased fairing methods, which are computationally more expensive, this is a linear time and space complexity algorithm
ASCENT: Adaptive selfconfiguring sensor networks topologies
, 2004
"... Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low pernode cost will allow these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks w ..."
Abstract

Cited by 449 (15 self)
 Add to MetaCart
configuration, and the environmental dynamics will preclude designtime preconfiguration. Therefore, nodes will have to selfconfigure to establish a topology that provides communication under stringent energy constraints. ASCENT builds on the notion that, as density increases, only a subset of the nodes
Marching cubes: A high resolution 3D surface construction algorithm
 COMPUTER GRAPHICS
, 1987
"... We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divideandconquer approach to generate interslice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical d ..."
Abstract

Cited by 2696 (4 self)
 Add to MetaCart
We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divideandconquer approach to generate interslice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical
The flooding time synchronization protocol
, 2004
"... Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. This paper introduces the robust Flooding Time Synchronization Protocol (FTSP), especially tailored for applications requir ..."
Abstract

Cited by 469 (16 self)
 Add to MetaCart
periodic radio broadcast of synchronization messages, and implicit dynamic topology update. The unique high precision performance is reached by utilizing MAClayer timestamping, comprehensive error compensation, including linear regression, which reduces time skew and keeps network traffic overhead low
A Growing Neural Gas Network Learns Topologies
 Advances in Neural Information Processing Systems 7
, 1995
"... An incremental network model is introduced which is able to learn the important topological relations in a given set of input vectors by means of a simple Hebblike learning rule. In contrast to previous approaches like the "neural gas" method of Martinetz and Schulten (1991, 1994), this m ..."
Abstract

Cited by 401 (5 self)
 Add to MetaCart
An incremental network model is introduced which is able to learn the important topological relations in a given set of input vectors by means of a simple Hebblike learning rule. In contrast to previous approaches like the "neural gas" method of Martinetz and Schulten (1991, 1994
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 405 (11 self)
 Add to MetaCart
We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled
Improved Localization of Cortical Activity by Combining EEG and MEG with MRI Cortical Surface Reconstruction: A Linear Approach
 J. Cogn. Neurosci
, 1993
"... We describe a comprehensive linear approach to the prob lem of imaging brain activity with high temporal as well as spatial resolution based on combining EEG and MEG data with anatomical constraints derived from MRI images. The "inverse problem" of estimating the distribution of dipole st ..."
Abstract

Cited by 263 (19 self)
 Add to MetaCart
We describe a comprehensive linear approach to the prob lem of imaging brain activity with high temporal as well as spatial resolution based on combining EEG and MEG data with anatomical constraints derived from MRI images. The "inverse problem" of estimating the distribution of dipole
On the gauge theory/geometry correspondence
 Adv. Theor. Math. Phys
, 1999
"... The ’t Hooft expansion of SU(N) ChernSimons theory on S3 is proposed to be exactly dual to the topological closed string theory on the S2 blow up of the conifold geometry. The Bfield on the S2 has magnitude Ngs = λ, the ’t Hooft coupling. We are able to make a number of checks, such as finding exa ..."
Abstract

Cited by 274 (36 self)
 Add to MetaCart
The ’t Hooft expansion of SU(N) ChernSimons theory on S3 is proposed to be exactly dual to the topological closed string theory on the S2 blow up of the conifold geometry. The Bfield on the S2 has magnitude Ngs = λ, the ’t Hooft coupling. We are able to make a number of checks, such as finding
Silk from a Sow's Ear: Extracting Usable Structures from the Web
, 1996
"... In its current implementation, the WorldWide Web lacks much of the explicit structure and strong typing found in many closed hypertext systems. While this property has directly fueled the explosive acceptance of the Web, it further complicates the already difficult problem of identifying usable str ..."
Abstract

Cited by 270 (9 self)
 Add to MetaCart
structural topology, i.e., the linkages between items. Other research has focused on content analysis to form document collections. This paper presents our exploration into techniques that harness both the topology and textual similarity between items as well as integrate new analyses based upon actual usage
Results 1  10
of
6,375