Sciweavers

315 search results - page 31 / 63
» Eigenvalue bounds for independent sets
Sort
View
CVPR
2009
IEEE
15 years 5 months ago
Volterrafaces: Discriminant Analysis using Volterra Kernels
In this paper we present a novel face classification system where we represent face images as a spatial arrangement of image patches, and seek a smooth non-linear functional map...
Ritwik Kumar, Arunava Banerjee, Baba C. Vemuri
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 10 months ago
Extracting shared subspace for multi-label classification
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...
Shuiwang Ji, Lei Tang, Shipeng Yu, Jieping Ye
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
12 years 9 days ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
DATAMINE
2010
133views more  DATAMINE 2010»
13 years 10 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
SIAMJO
2008
117views more  SIAMJO 2008»
13 years 9 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim