Sciweavers

247 search results - page 33 / 50
» Extracting All the Randomness from a Weakly Random Source
Sort
View
SIGECOM
2008
ACM
131views ECommerce» more  SIGECOM 2008»
15 years 19 days ago
Truthful germs are contagious: a local to global characterization of truthfulness
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
Aaron Archer, Robert Kleinberg
111
Voted
BMCBI
2005
125views more  BMCBI 2005»
15 years 18 days ago
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous ver...
Amarendran R. Subramanian, Jan Weyer-Menkhoff, Mic...
107
Voted
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 4 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
78
Voted
ISBI
2008
IEEE
16 years 1 months ago
Statistical colocalization in biological imaging with false discovery control
In this paper, we present a novel object-based statistical colocalization method. Our colocalization relies on multiple hypothesis tests on the distances between all pairs of the ...
Bo Zhang, Nicolas Chenouard, Jean-Christophe Olivo...
126
Voted
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
15 years 10 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi