4860 search results - page 280 / 972 » SNPs Problems, Complexity, and Algorithms |
161
click to vote
ICDAR
2005
IEEE
16 years 6 days 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...
201
click to vote
FOCS
2002
IEEE
15 years 11 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...
142
click to vote
UAI
2004
15 years 8 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...
182
click to vote
FCS
2006
15 years 8 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...
145
click to vote
STOC
2005
ACM
16 years 6 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...