Sciweavers

402 search results - page 11 / 81
» Constant-Time Approximation Algorithms via Local Improvement...
Sort
View
IACR
2011
141views more  IACR 2011»
12 years 7 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
PODC
2005
ACM
14 years 1 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ICPR
2010
IEEE
13 years 5 months ago
Efficient Polygonal Approximation of Digital Curves via Monte Carlo Optimization
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
Xiuzhuang Zhou, Yao Lu
ICBA
2004
Springer
144views Biometrics» more  ICBA 2004»
14 years 28 days ago
Improving Iris Recognition Accuracy via Cascaded Classifiers
As a reliable approach to human identification, iris recognition has received increasing attention in recent years. In the literature of iris recognition, local feature of image de...
Zhenan Sun, Yunhong Wang, Tieniu Tan, Jiali Cui
CVIU
2008
132views more  CVIU 2008»
13 years 7 months ago
Global parametric image alignment via high-order approximation
The estimation of parametric global motion is one of the cornerstones of computer vision. Such schemes are able to estimate various motion models (translation, rotation, affine, p...
Yosi Keller, Amir Averbuch