15 search results - page 3 / 3 » Extremal properties of polynomial threshold functions |
SIAMCOMP
2000
13 years 4 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
SIAMCO
2010
12 years 11 months ago
2010
This work is concerned with identification of Hammerstein systems whose outputs are measured by quantized sensors. The system consists of a memoryless nonlinearity that is polynomi...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
CCECE
2009
IEEE
13 years 11 months ago
2009
IEEE
A complex system is expected to show different nominal behaviors under different conditions, and the deviation over time from these nominal behaviors is an indicator of potential ...