Sciweavers

38 search results - page 1 / 8
» A constructive algorithm for realizing a distance matrix
Sort
View
EOR
2006
110views more  EOR 2006»
13 years 4 months ago
A constructive algorithm for realizing a distance matrix
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
Sacha C. Varone
SIAMMAX
2010
164views more  SIAMMAX 2010»
12 years 11 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
MFCS
2005
Springer
13 years 10 months ago
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Mi...
CISS
2007
IEEE
13 years 11 months ago
Relay Placement and Movement Control for Realization of Fault-Tolerant Ad Hoc Networks
— Wireless communication is a critical component of battlefield networks. Nodes in a battlefield network exist in hostile environments and thus fault-tolerance against node and...
Abhishek Kashyap, Mark A. Shayman
CDC
2008
IEEE
121views Control Systems» more  CDC 2008»
13 years 11 months ago
Lossless scalar functions: Boundary interpolation, Schur algorithm and Ober's canonical form
Abstract— In [1] a balanced canonical form for continuoustime lossless systems was presented. This form has a tridiagonal dynamical matrix A and the useful property that the corr...
Martine Olivi, Bernard Hanzon, Ralf L. M. Peeters