Sciweavers

2229 search results - page 99 / 446
» Comparative analysis of biclustering algorithms
Sort
View
SIAMJO
2002
115views more  SIAMJO 2002»
15 years 4 months ago
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
Alexey F. Izmailov, Mikhail V. Solodov
CVIU
2011
14 years 8 months ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
16 years 4 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
ICASSP
2008
IEEE
15 years 11 months ago
Unsupervised optimal phoneme segmentation: Objectives, algorithm and comparisons
Phoneme segmentation is a fundamental problem in many speech recognition and synthesis studies. Unsupervised phoneme segmentation assumes no knowledge on linguistic contents and a...
Yu Qiao, Naoya Shimomura, Nobuaki Minematsu
120
Voted
EPIA
2007
Springer
15 years 10 months ago
Evaluating Simulated Annealing Algorithms in the Optimization of Bacterial Strains
Abstract. In this work, a Simulated Annealing (SA) algorithm is proposed for a Metabolic Engineering task: the optimization of the set of gene deletions to apply to a microbial str...
Miguel Rocha, Rui Mendes, Paulo Maia, José ...