Sciweavers

4110 search results - page 520 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery
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 ...
Han Liu, Mark Palatucci, Jian Zhang
RECOMB
2002
Springer
16 years 7 months ago
Provably sensitive Indexing strategies for biosequence similarity search
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...
Jeremy Buhler
ISCAS
2008
IEEE
191views Hardware» more  ISCAS 2008»
16 years 1 months ago
A novel approach for K-best MIMO detection and its VLSI implementation
— 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...
Sudip Mondal, Khaled N. Salama, Wersame H. Ali
FPGA
2007
ACM
119views FPGA» more  FPGA 2007»
16 years 25 days ago
Synthesis of an application-specific soft multiprocessor system
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high ...
Jason Cong, Guoling Han, Wei Jiang
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 11 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang