Sciweavers

13376 search results - page 358 / 2676
» Problem Solving with
Sort
View
ICALP
2005
Springer
15 years 10 months ago
Linear Time Algorithms for Clustering Problems in Any Dimensions
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
Amit Kumar, Yogish Sabharwal, Sandeep Sen
ISAAC
2004
Springer
142views Algorithms» more  ISAAC 2004»
15 years 9 months ago
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
Qi Cheng, Ming-Deh A. Huang
DAM
2008
99views more  DAM 2008»
15 years 4 months ago
Boundary value problems on weighted networks
We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the...
Enrique Bendito, Angeles Carmona, Andrés M....
ALGORITHMICA
2006
149views more  ALGORITHMICA 2006»
15 years 4 months ago
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
Qi Cheng, Ming-Deh A. Huang
IEEEPACT
2006
IEEE
15 years 10 months ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...