328 search results - page 16 / 66 » Deterministic k-set structure |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
ICIP
1997
IEEE
14 years 8 months ago
1997
IEEE
In this paper we introduce a novel optimization framework for hierarchical data clustering and apply it to the problem of unsupervised texture segmentation. The proposed objective...
SYNASC
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a pivot-free deterministic algorithm for the inversion of block matrices. The method is based on the Moore-Penrose inverse and is applicable over certain general classe...
WIA
2004
Springer
14 years 20 days ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...