Sciweavers

2504 search results - page 444 / 501
» Methods for comparing rankings of search engine results
Sort
View
TCAD
2010
90views more  TCAD 2010»
14 years 4 months ago
Fast, Nearly Optimal ISE Identification With I/O Serialization Through Maximal Clique Enumeration
The last decade has witnessed the emergence of the application-specific instruction-set processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user ...
Ajay K. Verma, Philip Brisk, Paolo Ienne
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
14 years 10 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
BMCBI
2005
109views more  BMCBI 2005»
14 years 9 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...
SDM
2011
SIAM
223views Data Mining» more  SDM 2011»
14 years 17 days ago
Characterizing Uncertain Data using Compression
Motivated by sensor networks, mobility data, biology and life sciences, the area of mining uncertain data has recently received a great deal of attention. While various papers hav...
Francesco Bonchi, Matthijs van Leeuwen, Antti Ukko...
RECOMB
2006
Springer
15 years 10 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...