Sciweavers

1356 search results - page 237 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
ICA
2007
Springer
15 years 11 months ago
Compressed Sensing and Source Separation
Abstract. Separation of underdetermined mixtures is an important problem in signal processing that has attracted a great deal of attention over the years. Prior knowledge is requir...
Thomas Blumensath, Mike E. Davies
OOPSLA
2005
Springer
15 years 11 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 9 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
PICS
2000
15 years 6 months ago
Prism-Based Color Separation for Professional Digital Photography
In the field of silver-halide photography, color separation was explored about a century ago, using filter mosaics, dichroic mirrors, three-shot filtration, and other techniques, ...
Richard F. Lyon
BMCBI
2010
110views more  BMCBI 2010»
15 years 5 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
Tamir Tuller, Yifat Felder, Martin Kupiec