Sciweavers

94 search results - page 6 / 19
» On Regular Factors in Regular Graphs with Small Radius
Sort
View
SIAMDM
2008
97views more  SIAMDM 2008»
14 years 9 months ago
Large Nearly Regular Induced Subgraphs
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
Noga Alon, Michael Krivelevich, Benny Sudakov
COCO
2010
Springer
144views Algorithms» more  COCO 2010»
15 years 1 months ago
A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan...
ML
2008
ACM
146views Machine Learning» more  ML 2008»
14 years 9 months ago
Improving maximum margin matrix factorization
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
Markus Weimer, Alexandros Karatzoglou, Alex J. Smo...
DM
2008
97views more  DM 2008»
14 years 10 months ago
(r, r+1)-factorizations of (d, d+1)-graphs
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...
Anthony J. W. Hilton
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
14 years 10 months ago
Weighted Zeta Functions of Graph Coverings
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
Iwao Sato