Sciweavers

614 search results - page 61 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
MP
2008
103views more  MP 2008»
14 years 10 months ago
Aggregation and discretization in multistage stochastic programming
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
Daniel Kuhn
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 8 months ago
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
Franco Montagna, Carles Noguera
SDM
2009
SIAM
104views Data Mining» more  SDM 2009»
15 years 7 months ago
On Randomness Measures for Social Networks.
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
Xiaowei Ying, Xintao Wu
ECAI
2008
Springer
14 years 11 months ago
Structure segmentation and recognition in images guided by structural constraint propagation
In some application domains, such as medical imaging, the objects that compose the scene are known as well as some of their properties and their spatial arrangement. We can take ad...
Olivier Nempont, Jamal Atif, Elsa D. Angelini, Isa...
FM
2008
Springer
148views Formal Methods» more  FM 2008»
14 years 11 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl