3690 search results - page 302 / 738 » Computation with classical sequents |
171
click to vote
IWVF
2001
Springer
15 years 10 months ago
2001
Springer
We consider the interactions between edges and intensity distributions in semi-open image neighborhoods surrounding them. Locally this amounts to a kind of figure-ground problem, ...
124
click to vote
SCALESPACE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We propose a new complete method to extract significant description(s) of planar curves according to constant curvature segments. This method is based (i) on a multi-sca...
144
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
148
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
111
click to vote
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
Ridges and valleys are earth’s relief structures. They can have an imaging counterpart provided we model a digital image as a landscape by considering grey level values as heigh...