Sciweavers

393 search results - page 12 / 79
» Direct Sparse Deblurring
Sort
View
STACS
2010
Springer
14 years 4 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
SPIRE
2009
Springer
14 years 3 months ago
Directly Addressable Variable-Length Codes
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
PC
2010
100views Management» more  PC 2010»
13 years 3 months ago
Analysis of the solution phase of a parallel multifrontal approach
We study the forward and backward substitution phases of a sparse multifrontal factorization. These phases are often neglected in papers on sparse direct factorization but, in man...
Patrick Amestoy, Iain S. Duff, Abdou Guermouche, T...
PAMI
2007
183views more  PAMI 2007»
13 years 8 months ago
Variational Surface Interpolation from Sparse Point and Normal Data
Many visual cues for surface reconstruction from known views are sparse in nature, e.g. specularities, surface silhouettes and salient features in an otherwise textureless region....
Jan Erik Solem, Henrik Aanæs, Anders Heyden
ROBIO
2006
IEEE
148views Robotics» more  ROBIO 2006»
14 years 3 months ago
A Dynamic MDS-Based Localization Algorithm for Mobile Sensor Networks
Abstract— In this paper, we proposed a dynamic mobilityassisted MDS-based localization algorithms for sparse mobile sensor network. For sparse networks, the assumption of the exi...
Changhua Wu, Weihua Sheng, Wen-Zhan Song