6568 search results - page 302 / 1314 » Reducing the Complexity of Reductions |
207
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
154
click to vote
JCP
2007
15 years 6 months ago
2007
— Presented in this paper is a joint algorithm optimization and architecture design framework for analysis of repetitive regularities. Two closely coupled algorithm optimization ...
162
click to vote
NECO
2010
15 years 5 months ago
2010
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
182
click to vote
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
This paper describes the detection of faces in complex backgrounds where their sizes, positions and directions are arbitrary. We detect the faces by extracting face components suc...
176
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...