579 search results - page 10 / 116 » Intersecting Classes and Prototypes |
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
ALGORITHMICA
2006
13 years 7 months ago
2006
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
DM
2002
13 years 7 months ago
2002
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe cha...
IANDC
2008
13 years 7 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
ICNC
2005
Springer
14 years 1 months ago
2005
Springer
The Support vector machines derive the class decision hyper planes from a few, selected prototypes, the support vectors (SVs) according to the principle of structure risk minimizat...