Sciweavers

5115 search results - page 513 / 1023
» On Randomized Lanczos Algorithms
Sort
View
176
Voted
BMCBI
2007
128views more  BMCBI 2007»
15 years 6 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
JCB
2006
114views more  JCB 2006»
15 years 6 months ago
A General Modeling Strategy for Gene Regulatory Networks with Stochastic Dynamics
A stochastic genetic toggle switch model that consists of two identical, mutually repressive genes is built using the Gillespie algorithm with time delays as an example of a simpl...
Andre Ribeiro, Rui Zhu, Stuart A. Kauffman
207
Voted
SAT
2010
Springer
172views Hardware» more  SAT 2010»
15 years 5 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
237
Voted
ECCC
2011
282views ECommerce» more  ECCC 2011»
15 years 1 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
JCSS
2008
120views more  JCSS 2008»
15 years 6 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson