Sciweavers

1041 search results - page 205 / 209
» Randomizing Reductions of Search Problems
Sort
View
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
13 years 11 months ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
BMCBI
2010
139views more  BMCBI 2010»
13 years 7 months ago
A global optimization algorithm for protein surface alignment
Background: A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined w...
Paola Bertolazzi, Concettina Guerra, Giampaolo Liu...
MST
2006
104views more  MST 2006»
13 years 7 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
JCB
1998
129views more  JCB 1998»
13 years 7 months ago
A Sticker-Based Model for DNA Computation
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nic...
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
13 years 7 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger