Sciweavers

1480 search results - page 69 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
SAC
2003
ACM
14 years 28 days ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 2 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
ALGOSENSORS
2010
Springer
13 years 6 months ago
MSDR-D Network Localization Algorithm
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...
Kevin Coogan, Varun Khare, Stephen G. Kobourov, Ba...
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 7 months ago
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
Albert Fannjiang
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
14 years 2 months ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib