768 search results - page 80 / 154 » Asymptotic Cellular Complexity |
ICIP
2005
IEEE
14 years 2 months ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
WDAG
2005
Springer
14 years 2 months ago
2005
Springer
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
ICC
2000
IEEE
14 years 1 months ago
2000
IEEE
—A new and efficient class of nonlinear equalizers is developed for intersymbol interference (ISI) channels. These “iterated-decision equalizers” use an optimized multipass a...
STOC
1993
ACM
14 years 1 months ago
1993
ACM
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...