Sciweavers

414 search results - page 70 / 83
» On discrete norms of polynomials
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 10 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 10 months ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 9 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel
JSAC
2008
105views more  JSAC 2008»
13 years 9 months ago
Vector Precoding for Wireless MIMO Systems and its Replica Analysis
This paper studies a nonlinear vector precoding scheme which inverts the wireless multiple-input multiple-output (MIMO) channel at the transmitter so that simple symbol-bysymbol de...
Ralf R. Müller, Dongning Guo, Aris L. Moustak...
EOR
2007
102views more  EOR 2007»
13 years 9 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux