Sciweavers

598 search results - page 32 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
IPL
2007
101views more  IPL 2007»
13 years 8 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
14 years 3 days ago
Parametric model order reduction accelerated by subspace recycling
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
Lihong Feng, Peter Benner, Jan G. Korvink
ICASSP
2011
IEEE
13 years 13 days ago
The value of redundant measurement in compressed sensing
The aim of compressed sensing is to recover attributes of sparse signals using very few measurements. Given an overall bit budget for quantization, this paper demonstrates that th...
Victoria Kostina, Marco F. Duarte, Sina Jafarpour,...
CORR
2010
Springer
315views Education» more  CORR 2010»
13 years 3 months ago
Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks
Abstract--Based on the false assumption that multicast incapable (MI) nodes could not be traversed twice on the same wavelength, the light-tree structure was always thought to be o...
Fen Zhou, Miklós Molnár, Bernard Cou...
ICIP
2006
IEEE
14 years 10 months ago
Robust Diffusion of Structural Flows for Volumetric Image Interpolation
In this paper we propose a set of algorithms that combine the anisotropic smoothing using the heat kernel with the outlier rejection capability of robust statistics. The proposed ...
Ashish Doshi, Adrian G. Bors