4860 search results - page 280 / 972 » SNPs Problems, Complexity, and Algorithms |
105
Voted
ICDAR
2005
IEEE
15 years 6 months ago
2005
IEEE
In the field of computer analysis of document images, the problems of physical and logical layout analysis have been approached through a variety of heuristic, rule-based, and gr...
117
Voted
FOCS
2002
IEEE
15 years 5 months 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...
89
Voted
UAI
2004
15 years 2 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
112
Voted
FCS
2006
15 years 2 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
STOC
2005
ACM
16 years 1 months ago
2005
ACM
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...