131 search results - page 24 / 27 » Hypergraphs with independent neighborhoods |
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Subspace learning based face recognition methods have attracted considerable interests in recently years, including Principal Component Analysis (PCA), Linear Discriminant Analysi...