Sciweavers

4940 search results - page 867 / 988
» On the Complexity of Universal Programs
Sort
View
BMCBI
2010
123views more  BMCBI 2010»
15 years 6 months ago
Computationally efficient flux variability analysis
Background: Flux variability analysis is often used to determine robustness of metabolic models in various simulation conditions. However, its use has been somehow limited by the ...
Steinn Gudmundsson, Ines Thiele
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 6 months ago
A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
Danny Bickson, Elad Yom-Tov, Danny Dolev
CVIU
2008
109views more  CVIU 2008»
15 years 6 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
ENTCS
2008
122views more  ENTCS 2008»
15 years 6 months ago
Concurrency in Biological Modeling: Behavior, Execution and Visualization
Modeling natural systems is a complicated task that involves the concurrent behavior of various processes, mechanisms and objects. Here, we describe an approach that we have been ...
David Harel, Yaki Setty, Sol Efroni, Naamah Swerdl...
CORR
2006
Springer
85views Education» more  CORR 2006»
15 years 6 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil