Sciweavers

2200 search results - page 386 / 440
» Bloch's Constant is Computable
Sort
View
CIBCB
2007
IEEE
15 years 4 months ago
Modeling protein-DNA binding time in Stochastic Discrete Event Simulation of Biological Processes
Abstract— This paper presents a parametric model to estimate the DNA-protein binding time using the DNA and protein structures and details of the binding site. To understand the ...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...
FOCS
2007
IEEE
15 years 4 months ago
Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
Sudipto Guha, Kamesh Munagala
FOCS
2007
IEEE
15 years 4 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
NDSS
2007
IEEE
15 years 4 months ago
Generic Application-Level Protocol Analyzer and its Language
Application-level protocol analyzers are important components in tools such as intrusion detection systems, firewalls, and network monitors. Currently, protocol analyzers are wri...
Nikita Borisov, David Brumley, Helen J. Wang, John...
GD
2007
Springer
15 years 4 months ago
A Bipartite Strengthening of the Crossing Lemma
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
Jacob Fox, János Pach, Csaba D. Tóth