3778 search results - page 9 / 756 » Erdos-Ko-Rado for three sets |
IWPEC
2004
Springer
14 years 2 days ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
ICML
2007
IEEE
14 years 7 months ago
2007
IEEE
The supremacy of n-gram models in statistical language modelling has recently been challenged by parametric models that use distributed representations to counteract the difficult...
ICIDS
2009
Springer
14 years 1 months ago
2009
Springer
This paper introduces PoliCultura, a project created by Politecnico di Milano for the Italian schools, which has just completed three years of deployment. Participating classes (wi...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
Mining patterns involving multiple values that are significantly relevant is a difficult but very important problem that crosses many disciplines. Multi-value association patterns...
COMPGEOM
2004
ACM
14 years 4 days ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...