Sciweavers

1201 search results - page 45 / 241
» Linear Probing and Graphs
Sort
View
SIAMCOMP
2011
13 years 1 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
WCE
2007
14 years 5 days ago
Anisotropic Imaging Of Tumours Using Elastic Wave Signals
—In this short paper we show how one may extract elastic properties of materials by probing it with elastic waves and processing the signal that returns (i.e. the scattered waves...
Clifford J. Nolan, Niall Ryan
COMPGEOM
2008
ACM
14 years 24 days ago
Reeb spaces of piecewise linear mappings
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
Herbert Edelsbrunner, John Harer, Amit K. Patel
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
14 years 23 days ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
JEA
2008
88views more  JEA 2008»
13 years 11 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt