10848 search results - page 430 / 2170 » Programming in Biomolecular Computation |
192
click to vote
FUN
2007
Springer
16 years 1 months ago
2007
Springer
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
190
Voted
CONCUR
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. In this paper we show how to compress efficiently the statespace of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that ...
194
click to vote
FCT
2003
Springer
16 years 28 days ago
2003
Springer
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
184
click to vote
DISOPT
2007
15 years 7 months ago
2007
We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks subject to multiple scenarios of externally caused da...
249
click to vote
JMLR
2012
13 years 10 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...