Sciweavers

5105 search results - page 862 / 1021
» An algorithm to determine peer-reviewers
Sort
View
POPL
2005
ACM
16 years 6 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
RECOMB
2003
Springer
16 years 6 months ago
Whole-genome comparative annotation and regulatory motif discovery in multiple yeast species
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...
Manolis Kamvysselis, Nick Patterson, Bruce Birren,...
STOC
2003
ACM
117views Algorithms» more  STOC 2003»
16 years 6 months ago
Distinct distances in three and higher dimensions
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
Boris Aronov, János Pach, Micha Sharir, G&a...
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
16 years 6 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
PODS
2005
ACM
130views Database» more  PODS 2005»
16 years 6 months ago
Composition of mappings given by embedded dependencies
Composition of mappings between schemas is essential to support schema evolution, data exchange, data integration, and other data management tasks. In many applications, mappings ...
Alan Nash, Philip A. Bernstein, Sergey Melnik