Sciweavers

188 search results - page 18 / 38
» An Algorithm for Solving Systems of Linear Diophantine Equat...
Sort
View
ACTA
2006
104views more  ACTA 2006»
13 years 7 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
DAC
2009
ACM
14 years 8 months ago
A direct integral-equation solver of linear complexity for large-scale 3D capacitance and impedance extraction
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
Wenwen Chai, Dan Jiao, Cheng-Kok Koh
DAGSTUHL
2007
13 years 9 months ago
Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 7 months ago
Analysis of a Splitting Estimator for Rare Event Probabilities in Jackson Networks
We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed i...
Jose Blanchet, Kevin Leder, Yixi Shi
NIPS
1998
13 years 9 months ago
Learning Nonlinear Dynamical Systems Using an EM Algorithm
The Expectation Maximization EM algorithm is an iterative procedure for maximum likelihood parameter estimation from data sets with missing or hidden variables 2 . It has been app...
Zoubin Ghahramani, Sam T. Roweis