Sciweavers

12148 search results - page 402 / 2430
» Generalized Bundle Methods
Sort
View
236
Voted
MFCS
2005
Springer
16 years 1 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
183
Voted
ANTS
2004
Springer
114views Algorithms» more  ANTS 2004»
16 years 29 days ago
Montgomery Scalar Multiplication for Genus 2 Curves
Using powerful tools on genus 2 curves like the Kummer variety, we generalize the Montgomery method for scalar multiplication to the jacobian of these curves. Previously this metho...
Sylvain Duquesne
ASIACRYPT
2004
Springer
16 years 29 days ago
The XL-Algorithm and a Conjecture from Commutative Algebra
The “XL-algorithm” is a computational method to solve overdetermined systems of polynomial equations which is based on a generalization of the well-known method of linearizatio...
Claus Diem
GD
2004
Springer
16 years 29 days ago
The Metro Map Layout Problem
We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic crit...
Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nasci...
217
Voted
ICA
2004
Springer
16 years 29 days ago
Blind Maximum Likelihood Separation of a Linear-Quadratic Mixture
Abstract. We proposed recently a new method for separating linearquadratic mixtures of independent real sources, based on parametric identification of a recurrent separating struc...
Shahram Hosseini, Yannick Deville