Sciweavers

2414 search results - page 14 / 483
» Computing Normal Subgroups
Sort
View
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
15 years 4 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
ASIACRYPT
2008
Springer
14 years 11 months ago
Speeding Up the Pollard Rho Method on Prime Fields
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
Jung Hee Cheon, Jin Hong, Minkyu Kim
DAM
2008
123views more  DAM 2008»
14 years 9 months ago
Ultrametrics, Banach's fixed point theorem and the Riordan group
We interpret the reciprocation process in K[[x]] as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamic...
Ana Luzón, Manuel A. Morón
70
Voted
ICCV
1998
IEEE
15 years 11 months ago
Motion Segmentation and Tracking Using Normalized Cuts
Jianbo Shi, Jitendra Malik
67
Voted
CCCG
2008
14 years 11 months ago
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time
Simple curves on surfaces are often represented as sequences of intersections with a triangulation. However, there are much more succinct ways of representing simple curves used i...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic