Sciweavers

3353 search results - page 423 / 671
» Laver and set theory
Sort
View
189
Voted
ICML
2006
IEEE
16 years 8 months ago
A DC-programming algorithm for kernel selection
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
Andreas Argyriou, Raphael Hauser, Charles A. Micch...
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
16 years 8 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
180
Voted
CHI
2009
ACM
16 years 8 months ago
Touch and toys: new techniques for interaction with a remote group of robots
Interaction with a remote team of robots in real time is a difficult human-robot interaction (HRI) problem exacerbated by the complications of unpredictable realworld environments...
Cheng Guo, James Everett Young, Ehud Sharlin
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 7 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
216
Voted
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 7 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth