Sciweavers

676 search results - page 5 / 136
» Sub-stochastic matrix analysis for bounds computation - Theo...
Sort
View
FMCAD
2004
Springer
14 years 22 days ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 4 months ago
The Stability of Low-Rank Matrix Reconstruction: a Constrained Singular Value View
The stability of low-rank matrix reconstruction is investigated in this paper. The -constrained minimal singular value ( -CMSV) of the measurement operator is shown to determine t...
Gongguo Tang, Arye Nehorai
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
13 years 5 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak
MST
2010
121views more  MST 2010»
13 years 5 months ago
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
Stasys Jukna
NIPS
2001
13 years 8 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...