Sciweavers

1640 search results - page 237 / 328
» Conditional Independence Trees
Sort
View
VLSID
2005
IEEE
255views VLSI» more  VLSID 2005»
14 years 9 months ago
Estimation of Switching Activity in Sequential Circuits Using Dynamic Bayesian Networks
We propose a novel, non-simulative, probabilistic model for switching activity in sequential circuits, capturing both spatio-temporal correlations at internal nodes and higher ord...
Sanjukta Bhanja, Karthikeyan Lingasubramanian, N. ...
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
14 years 9 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 9 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
CVPR
2010
IEEE
14 years 4 months ago
Sufficient Dimensionality Reduction for Visual Sequence Classification
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
Alex Shyr, Raquel Urtasun, Michael Jordan
CVPR
2010
IEEE
14 years 4 months ago
Non-Rigid Structure from Locally-Rigid Motion
We introduce locally-rigid motion, a general framework for solving the M-point, N-view structure-from-motion problem for unknown bodies deforming under orthography. The key idea i...
Jonathan Taylor, Allan Jepson, Kyros Kutulakos