1146 search results - page 107 / 230 » Finite cupping sets |
ICC
2011
IEEE
12 years 9 months ago
2011
IEEE
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
ICPR
2006
IEEE
14 years 11 months ago
2006
IEEE
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
ISIPTA
2005
IEEE
14 years 3 months ago
2005
IEEE
: A generalization of subjective expected utility is presented in which the primitives are a finite set of states of the world, a finite set of strategies available to the decision...
ICDT
2003
ACM
14 years 3 months ago
2003
ACM
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
ICALP
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...