2969 search results - page 107 / 594 » A space efficient algorithm for group structure computation |
140
Voted
KDD
2001
ACM
16 years 3 months ago
2001
ACM
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...
117
Voted
WG
2005
Springer
15 years 8 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
168
click to vote
ALIFE
1999
15 years 3 months ago
1999
A novel machine language genetic programming system that uses one-dimensional core memories is proposed and simulated. The core is compared to a biochemical reaction space, and in ...
158
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
155
Voted
PPAM
2007
Springer
15 years 9 months ago
2007
Springer
For about ten years now, Bo K˚agstr¨om’s Group in Umea, Sweden, Jerzy Wa´sniewski’s Team at Danish Technical University in Lyngby, Denmark, and I at IBM Research in Yorktown...