Sciweavers

945 search results - page 113 / 189
» Incremental Branching Programs
Sort
View
TOMS
2008
80views more  TOMS 2008»
13 years 7 months ago
Updating an LU Factorization with Pivoting
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
Enrique S. Quintana-Ortí, Robert A. van de ...
ICML
2009
IEEE
14 years 8 months ago
Structure learning of Bayesian networks using constraints
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
Cassio Polpo de Campos, Zhi Zeng, Qiang Ji
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 2 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
CC
2007
Springer
118views System Software» more  CC 2007»
14 years 2 months ago
A Practical Escape and Effect Analysis for Building Lightweight Method Summaries
We present a unification-based, context-sensitive escape and effect analysis that infers lightweight method summaries describing heap effects. The analysis is parameterized on two...
Sigmund Cherem, Radu Rugina
CPAIOR
2005
Springer
14 years 1 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker