Sciweavers

1282 search results - page 42 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 8 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 7 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
PPOPP
2010
ACM
14 years 5 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
RECOMB
2003
Springer
14 years 8 months ago
Designing seeds for similarity search in genomic DNA
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
Jeremy Buhler, Uri Keich, Yanni Sun
ICASSP
2008
IEEE
14 years 2 months ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...