10608 search results - page 557 / 2122 » Complexity of O'Hara's Algorithm |
176
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
236
click to vote
JOC
2010
15 years 1 months ago
2010
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
165
click to vote
ICPR
2004
IEEE
16 years 8 months ago
2004
IEEE
This paper describes an algorithm that efficiently groups line segments into perceptually salient contours in complex images. A measure of affinity between pairs of lines is used ...
144
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...
186
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...