Sciweavers

868 search results - page 2 / 174
» Dynamic Connectivity: Connecting to Networks and Geometry
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 11 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
IWCMC
2006
ACM
14 years 1 months ago
Dynamic and automatic connection of personal area networks to the global internet
In the Next Generation Networks (NGNs) users will carry multiple devices forming cooperative networks known as Personal Area Networks (PANs). Some existing technologies enable thi...
Rui Campos, Manuel Ricardo
CGF
2000
174views more  CGF 2000»
13 years 7 months ago
Multiresolution shape deformations for meshes with dynamic vertex connectivity
Multiresolution shape representation is a very effective way to decompose surface geometry into several levels of detail. Geometric modeling with such representations enables flex...
Leif Kobbelt, Thilo Bareuther, Hans-Peter Seidel
NECO
2010
147views more  NECO 2010»
13 years 5 months ago
Connectivity, Dynamics, and Memory in Reservoir Computing with Binary and Analog Neurons
Abstract: Reservoir Computing (RC) systems are powerful models for online computations on input sequences. They consist of a memoryless readout neuron which is trained on top of a ...
Lars Büsing, Benjamin Schrauwen, Robert A. Le...
IPPS
2009
IEEE
14 years 2 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader