Sciweavers

1469 search results - page 117 / 294
» Approximate polynomial decomposition
Sort
View
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 2 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
GISCIENCE
2004
Springer
130views GIS» more  GISCIENCE 2004»
15 years 3 months ago
Comparing Exact and Approximate Spatial Auto-regression Model Solutions for Spatial Data Analysis
The spatial auto-regression (SAR) model is a popular spatial data analysis technique, which has been used in many applications with geo-spatial datasets. However, exact solutions f...
Baris M. Kazar, Shashi Shekhar, David J. Lilja, Ra...
DAM
2006
88views more  DAM 2006»
14 years 10 months ago
Domination analysis for minimum multiprocessor scheduling
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
Gregory Gutin, Tommy R. Jensen, Anders Yeo
CAGD
2007
69views more  CAGD 2007»
14 years 10 months ago
On geometric interpolation of circle-like curves
In this paper, geometric interpolation of certain circle-like curves by parametric polynomial curves is studied. It is shown that such an interpolating curve of degree n achieves ...
Gasper Jaklic, Jernej Kozak, Marjeta Krajnc, Emil ...
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
15 years 1 months ago
Spectral techniques for graph bisection in genetic algorithms
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
Jacob G. Martin