Sciweavers

1279 search results - page 141 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
SIP
2003
15 years 3 months ago
Design of Full Band IIR Digital Differentiators
This paper presents an efficient method for designing full band IIR digital differentiators in the complex Chebyshev sense. The proposed method is based on the formulation of a g...
Xi Zhang, Toshinori Yoshikawa
COMPGEOM
2006
ACM
15 years 8 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 5 months ago
Inside a predator-prey model for multi-objective optimization: a second study
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
Christian Grimme, Karlheinz Schmitt
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 3 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
15 years 1 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan