Sciweavers

914 search results - page 145 / 183
» Design spaces: The explicit representation of spaces of alte...
Sort
View
BMCBI
2004
115views more  BMCBI 2004»
14 years 9 months ago
An SVD-based comparison of nine whole eukaryotic genomes supports a coelomate rather than ecdysozoan lineage
Background: Eukaryotic whole genome sequences are accumulating at an impressive rate. Effective methods for comparing multiple whole eukaryotic genomes on a large scale are needed...
Gary W. Stuart, Michael W. Berry
GPEM
2002
95views more  GPEM 2002»
14 years 9 months ago
On Appropriate Adaptation Levels for the Learning of Gene Linkage
A number of algorithms have been proposed aimed at tackling the problem of learning "Gene Linkage" within the context of genetic optimisation, that is to say, the problem...
James Smith
PERCOM
2011
ACM
14 years 1 months ago
PoX: Protecting users from malicious Facebook applications
Abstract—Online social networks such as Facebook, MySpace, and Orkut store large amounts of sensitive user data. While a user can legitimately assume that a social network provid...
Manuel Egele, Andreas Moser, Christopher Kruegel, ...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani