Sciweavers

2635 search results - page 92 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICDT
2007
ACM
74views Database» more  ICDT 2007»
15 years 8 months ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu
PR
1998
86views more  PR 1998»
15 years 3 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
BMCBI
2007
177views more  BMCBI 2007»
15 years 4 months ago
The BioPrompt-box: an ontology-based clustering tool for searching in biological databases
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
Claudio Corsi, Paolo Ferragina, Roberto Marangoni
VLSID
2007
IEEE
206views VLSI» more  VLSID 2007»
16 years 4 months ago
MAX: A Multi Objective Memory Architecture eXploration Framework for Embedded Systems-on-Chip
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and l...
T. S. Rajesh Kumar, C. P. Ravikumar, R. Govindaraj...
DEXA
2010
Springer
156views Database» more  DEXA 2010»
15 years 5 months ago
Improving Alternative Text Clustering Quality in the Avoiding Bias Task with Spectral and Flat Partition Algorithms
Abstract. The problems of finding alternative clusterings and avoiding bias have gained popularity over the last years. In this paper we put the focus on the quality of these alter...
M. Eduardo Ares, Javier Parapar, Alvaro Barreiro