400 search results - page 30 / 80 » Subspace evasive sets |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Multi-label problems arise in various domains such as multitopic document categorization and protein function prediction. One natural way to deal with such problems is to construc...
SIAMSC
2010
13 years 6 months ago
2010
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
There are many clustering tasks which are closely related in the real world, e.g. clustering the web pages of different universities. However, existing clustering approaches neglec...
SIAMDM
2011
13 years 2 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
CHES
2006
Springer
13 years 11 months ago
2006
Springer
Side-channel attacks are a serious threat to implementations of cryptographic algorithms. Secret information is recovered based on power consumption, electromagnetic emanations or ...