4112 search results - page 401 / 823 » Efficient Algorithms for the Spoonerism Problem |
232
click to vote
MICCAI
2007
Springer
16 years 8 months ago
2007
Springer
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
199
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
179
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
We develop a cyclical blockwise coordinate descent algorithm for the multi-task Lasso that efficiently solves problems with thousands of features and tasks. The main result shows ...
187
click to vote
RECOMB
2002
Springer
16 years 8 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
213
click to vote
ISCAS
2008
IEEE
16 years 2 months ago
2008
IEEE
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...