1039 search results - page 95 / 208 » Kernels and Regularization on Graphs |
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
122
Voted
AI
2010
Springer
15 years 26 days ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
109
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper suggests a method for multiclass learning with many classes by simultaneously learning shared characteristics common to the classes, and predictors for the classes in t...
COMBINATORICS
1999
15 years 12 days ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
105
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...