1433 search results - page 51 / 287 » On Covering Problems of Rado |
COMBINATORICS
2007
14 years 11 months ago
2007
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
JWSR
2007
14 years 11 months ago
2007
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose a novel consistent max-covering scheme for
human pose estimation. Consistent max-covering formulates
pose estimation as the covering of body part polygons
on an objec...
103
click to vote
ICML
2001
IEEE
16 years 19 days ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...