Sciweavers

2517 search results - page 323 / 504
» Specifying Weak Sets
Sort
View
185
Voted
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 11 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
ATAL
2008
Springer
15 years 8 months ago
Strategyproof deterministic lotteries under broadcast communication
The design of deterministic and fair mechanisms for selection among a set of self-motivated agents based solely on these agents' input is a major challenge in multiagent syst...
Alon Altman, Moshe Tennenholtz
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
15 years 8 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
BIRTHDAY
2010
Springer
15 years 7 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
ALMOB
2007
74views more  ALMOB 2007»
15 years 6 months ago
Evaluating deterministic motif significance measures in protein databases
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...
Pedro Gabriel Ferreira, Paulo J. Azevedo