Sciweavers

1632 search results - page 257 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
130
Voted
CEC
2005
IEEE
15 years 9 months ago
Dynamic niching in evolution strategies with covariance matrix adaptation
Abstract- Evolutionary Algorithms (EAs) have the tendency to converge quickly into a single solution in the search space. However, many complex search problems require the identi...
Ofer M. Shir, Thomas Bäck
205
Voted
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 3 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
156
Voted
CF
2007
ACM
15 years 7 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
144
Voted
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 10 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
126
Voted
IDA
2002
Springer
15 years 3 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel