Sciweavers

7168 search results - page 17 / 1434
» A Factorization Approach to Grouping
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
15 years 4 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
JASIS
2008
109views more  JASIS 2008»
14 years 10 months ago
Modifying the journal impact factor by fractional citation weighting: The audience factor
A new approach to the field normalization of the classical journal impact factor is introduced called the audience factor. This approach takes into consideration the citing propen...
Michel Zitt, Henry Small
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 10 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
PKC
2009
Springer
175views Cryptology» more  PKC 2009»
15 years 10 months ago
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
We address the problem of polynomial time factoring RSA moduli N1 = p1q1 with the help of an oracle. As opposed to other approaches that require an oracle that explicitly outputs b...
Alexander May, Maike Ritzenhofen
CANS
2009
Springer
121views Cryptology» more  CANS 2009»
15 years 4 months ago
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
Marc Joye