Sciweavers

1110 search results - page 117 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
15 years 5 months ago
Non-breaking Similarity of Genomes with Gene Repetitions
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...
ICWE
2010
Springer
15 years 3 months ago
Ranking the Linked Data: The Case of DBpedia
The recent proliferation of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scal...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...
CEC
2010
IEEE
14 years 6 months ago
Multi-objective robust static mapping of independent tasks on grids
We study the problem of efficiently allocating incoming independent tasks onto the resources of a Grid system. Typically, it is assumed that the estimated time to compute each task...
Bernabé Dorronsoro Díaz, Pascal Bouv...
BMCBI
2004
169views more  BMCBI 2004»
14 years 11 months ago
A power law global error model for the identification of differentially expressed genes in microarray data
Background: High-density oligonucleotide microarray technology enables the discovery of genes that are transcriptionally modulated in different biological samples due to physiolog...
Norman Pavelka, Mattia Pelizzola, Caterina Vizzard...
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
15 years 2 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...