Sciweavers

178 search results - page 7 / 36
» LSMR: An iterative algorithm for sparse least-squares proble...
Sort
View
CN
2007
141views more  CN 2007»
13 years 7 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou
PRL
2010
310views more  PRL 2010»
13 years 5 months ago
A Lagrangian Half-Quadratic approach to robust estimation and its applications to road scene analysis
We consider the problem of fitting linearly parameterized models, that arises in many computer vision problems such as road scene analysis. Data extracted from images usually cont...
Jean-Philippe Tarel, Pierre Charbonnier
CSDA
2006
98views more  CSDA 2006»
13 years 7 months ago
Frequency estimation of undamped exponential signals using genetic algorithms
: In this paper, we consider the problem of frequency estimation of undamped superimposed exponential signals model. We propose two iterative techniques of frequency estimation usi...
Amit Mitra, Debasis Kundu, Gunjan Agrawal
ISBI
2009
IEEE
14 years 2 months ago
3D Eigenfunction Expansion of Sparsely Sampled 2D Cortical Data
Various cortical measures such as cortical thickness are routinely computed along the vertices of cortical surface meshes. These metrics are used in surface-based morphometric stu...
Moo K. Chung, Yu-Chien Wu, Andrew L. Alexander
ISSAC
2007
Springer
111views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Numerical optimization in hybrid symbolic-numeric computation
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
Lihong Zhi