10608 search results - page 708 / 2122 » Complexity of O'Hara's Algorithm |
199
click to vote
SIAMCOMP
1998
15 years 7 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
241
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
215
click to vote
ICIP
2007
IEEE
16 years 9 months ago
2007
IEEE
A new method for object tracking in video sequences is presented. This method exploits the benefits of particle filters to tackle the multimodal distributions emerging from clutte...
245
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
183
click to vote
VTC
2008
IEEE
16 years 1 months ago
2008
IEEE
— When an iterative-decoding aided system is configured to operate at a near-capacity performance, an excessive complexity may be imposed by the iterative process. In this paper...