Sciweavers

863 search results - page 79 / 173
» The Light Bulb Problem
Sort
View
ICASSP
2008
IEEE
15 years 9 months ago
Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
Yuzhe Jin, Bhaskar D. Rao
BIBE
2007
IEEE
174views Bioinformatics» more  BIBE 2007»
15 years 9 months ago
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
GLOBECOM
2006
IEEE
15 years 9 months ago
Connection Preemption in Multi-Class Networks
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
Fahad Rafique Dogar, Laeeq Aslam, Zartash Afzal Uz...
IMR
2004
Springer
15 years 8 months ago
Twelve Ways to Fool The Masses when Describing Mesh Generation Performance
Mesh generation for finite element analysis is far from a solved problem. Although several automatic meshing algorithms exist, other difficulties of setting up a problem for finit...
Timothy J. Tautges, David R. White, Robert W. Lela...
120
Voted
ICCV
1999
IEEE
15 years 7 months ago
Learning Low-Level Vision
We describe a learning-based method for low-level vision problems--estimating scenes from images. We generate a synthetic world of scenes and their corresponding rendered images, m...
William T. Freeman, Egon C. Pasztor