Sciweavers

909 search results - page 146 / 182
» Reversible data hiding
Sort
View
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
14 years 3 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
14 years 3 months ago
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
Michael B. Monagan, Roman Pearce
MSR
2006
ACM
14 years 3 months ago
The evolution radar: visualizing integrated logical coupling information
In software evolution research logical coupling has extensively been used to recover the hidden dependencies between source code artifacts. They would otherwise go lost because of...
Marco D'Ambros, Michele Lanza, Mircea Lungu
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
14 years 2 months ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi
CSB
2003
IEEE
128views Bioinformatics» more  CSB 2003»
14 years 2 months ago
Degenerate Primer Design via Clustering
This paper describes a new strategy for designing degenerate primers for a given multiple alignment of amino acid sequences. Degenerate primers are useful for amplifying homologou...
Xintao Wei, David N. Kuhn, Giri Narasimhan