901 search results - page 93 / 181 » Analyzing linear mergers |
150
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
168
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Quantum computer programming is emerging as a new subject domain from multidisciplinary research in quantum computing, computer science, mathematics (especially quantum logic, lamb...
134
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- We analyze the performance of low-density generator matrix (LDGM) codes for lossy source coding. We first develop a generic technique for deriving lower bounds on the ef...
194
click to vote
CPHYSICS
2006
15 years 6 months ago
2006
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
169
click to vote
EOR
2006
15 years 6 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...