Sciweavers

20066 search results - page 247 / 4014
» T Spaces
Sort
View
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
15 years 7 months ago
Adaptive discretization on multidimensional continuous search spaces
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
Jiun-Jiue Liou, Ying-Ping Chen
APPROX
2010
Springer
160views Algorithms» more  APPROX 2010»
15 years 6 months ago
Proximity Algorithms for Nearly-Doubling Spaces
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
Lee-Ad Gottlieb, Robert Krauthgamer
ALGORITHMICA
2008
121views more  ALGORITHMICA 2008»
15 years 6 months ago
Space Efficient Algorithms for Ordered Tree Comparison
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
Lusheng Wang, Kaizhong Zhang
BMCBI
2008
97views more  BMCBI 2008»
15 years 6 months ago
Comparison study on k-word statistical measures for protein: From sequence to 'sequence space'
Background: Many proposed statistical measures can efficiently compare protein sequence to further infer protein structure, function and evolutionary information. They share the s...
Qi Dai, Tian-Ming Wang
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 6 months ago
Linear programming bounds for unitary space time codes
The linear programming method is applied to the space Un(C) of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theore...
Jean Creignou, Hervé Diet