Sciweavers

1707 search results - page 182 / 342
» A Computational Model for Arguments Understanding
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 9 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
150
Voted
FOCS
2007
IEEE
15 years 9 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay
VIS
2004
IEEE
227views Visualization» more  VIS 2004»
16 years 6 months ago
Intuitive and Interactive Modification of Large Finite Element Models
Virtual prototyping is increasingly replacing real mock-ups and experiments in industrial product development. Part of this process is the simulation of structural and functional ...
Dirc Rose, Katrin Bidmon, Thomas Ertl
LATIN
2004
Springer
15 years 10 months ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
CIBCB
2007
IEEE
15 years 11 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. ...