579 search results - page 27 / 116 » Intersecting Classes and Prototypes |
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
FOCS
2002
IEEE
14 years 21 days ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
ECCC
2006
13 years 7 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
DASFAA
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract. Besides topological relations and approximate relations, cardinal directions have turned out to be an important class of qualitative spatial relations. In spatial databas...
IBPRIA
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. We compare two successful discriminative classification algorithms on three databases from the UCI and STATLOG repositories. The two approaches are the log-linear model ...