Sciweavers

725 search results - page 89 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
15 years 3 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
COMPGEOM
2006
ACM
15 years 3 months ago
Embedding ultrametrics into low-dimensional spaces
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
COMPGEOM
2006
ACM
15 years 3 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
IPL
2006
97views more  IPL 2006»
14 years 9 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
ISSAC
1995
Springer
119views Mathematics» more  ISSAC 1995»
15 years 1 months ago
The Singular Value Decomposition for Polynomial Systems
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
Robert M. Corless, Patrizia M. Gianni, Barry M. Tr...