11321 search results - page 14 / 2265 » Improvements to Turing's method |
127
click to vote
ICA
2007
Springer
15 years 8 months ago
2007
Springer
In underdetermined blind source separation problems, it is common practice to exploit the underlying sparsity of the sources for demixing. In this work, we propose two sparse decom...
120
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
DAC
1998
ACM
16 years 2 months ago
1998
ACM
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
120
click to vote
AAAI
1994
15 years 3 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...