Sciweavers

432 search results - page 63 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
JDA
2007
97views more  JDA 2007»
13 years 7 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 7 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
MICCAI
2010
Springer
13 years 6 months ago
Statistical Analysis of Structural Brain Connectivity
Abstract. We present a framework for statistical analysis in large cohorts of structural brain connectivity, derived from diffusion weighted MRI. A brain network is defined betwe...
Renske de Boer, Michiel Schaap, Fedde van der Lijn...
ICDM
2010
IEEE
232views Data Mining» more  ICDM 2010»
13 years 4 months ago
gSkeletonClu: Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration
Community detection is an important task for mining the structure and function of complex networks. Many pervious approaches are difficult to detect communities with arbitrary size...
Heli Sun, Jianbin Huang, Jiawei Han, Hongbo Deng, ...
TIT
2010
143views Education» more  TIT 2010»
13 years 2 months ago
Asynchronous CDMA systems with random spreading-part I: fundamental limits
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
Laura Cottatellucci, Ralf R. Müller, Mé...