Sciweavers

890 search results - page 155 / 178
» New Approaches to Compare Phylogenetic Search Heuristics
Sort
View
GLOBECOM
2008
IEEE
16 years 17 days ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
GLOBECOM
2006
IEEE
16 years 5 days ago
Scalable Design of Space-Time Trellis Code with Low Decoding Complexity
—Design of space-time codes that scale with the number of transmit antennas is a difficult problem. In this paper, we introduce a new family of space-time trellis codes (STTC) th...
Kyungmin Kim, Hamid R. Sadjadpour, Rick S. Blum, Y...
SIGIR
2006
ACM
16 years 2 days ago
Probabilistic latent query analysis for combining multiple retrieval sources
Combining the output from multiple retrieval sources over the same document collection is of great importance to a number of retrieval tasks such as multimedia retrieval, web retr...
Rong Yan, Alexander G. Hauptmann
ICDM
2005
IEEE
190views Data Mining» more  ICDM 2005»
15 years 11 months ago
Adaptive Clustering: Obtaining Better Clusters Using Feedback and Past Experience
Adaptive clustering uses external feedback to improve cluster quality; past experience serves to speed up execution time. An adaptive clustering environment is proposed that uses ...
Abraham Bagherjeiran, Christoph F. Eick, Chun-Shen...
AUSAI
2005
Springer
15 years 11 months ago
Accelerating Real-Valued Genetic Algorithms Using Mutation-with-Momentum
: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
Luke Temby, Peter Vamplew, Adam Berry