Sciweavers

2144 search results - page 375 / 429
» Exact Flow Analysis
Sort
View
JMLR
2008
188views more  JMLR 2008»
15 years 3 months ago
Maximal Causes for Non-linear Component Extraction
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
Jörg Lücke, Maneesh Sahani
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 2 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
152
Voted
IJSI
2010
84views more  IJSI 2010»
15 years 2 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
IPL
2010
112views more  IPL 2010»
15 years 2 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
MP
2010
94views more  MP 2010»
15 years 2 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi