4066 search results - page 21 / 814 » Almost Complete Sets |
ENDM
2007
13 years 7 months ago
2007
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
AIPS
1998
13 years 9 months ago
1998
The PRODIGY system is based on bidirectional planning, which is a combination of goal-directed backward chaining with simulation of plan execution. Experiments have demonstrated t...
RTA
1997
Springer
13 years 11 months ago
1997
Springer
Series-parallel orders are de ned as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive de nition,...
COLING
2008
13 years 9 months ago
2008
We present a complete system that generates Japanese stand-up comedy. Different modules generating different types of jokes are tied together into a performance where all jokes ar...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...