We address the problem of parameter estimation in presence
of both uncertainty and outlier noise. This is a common
occurrence in computer vision: feature localization
is perform...
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
Metasearch engine, Comparison-shopping and Deep Web crawling applications need to extract search result records enwrapped in result pages returned from search engines in response ...
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
Robert P. Gallant, Robert J. Lambert, Scott A. Van...