Sciweavers

7978 search results - page 98 / 1596
» Combining shared-coin algorithms
Sort
View
DAC
2007
ACM
16 years 20 days ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
ICML
2007
IEEE
16 years 14 days ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
CVPR
2010
IEEE
15 years 8 months ago
Combining Discriminative and Generative Methods for 3D Deformable Surface and Articulated Pose Reconstruction
Historically non-rigid shape recovery and articulated pose estimation have evolved as separate fields. Recent methods for non-rigid shape recovery have focused on improving the a...
Mathieu Salzmann, Raquel Urtasun
ICC
2009
IEEE
140views Communications» more  ICC 2009»
15 years 6 months ago
Rate-Per-Link Adaptation in Cooperative Wireless Networks with Multi-Rate Combining
—Rate adaptation based on Signal-to-Noise Ratio (SNR) measurements is a common channel adaptation scheme to increase throughput in wireless communication systems. To use rate ada...
Hermann S. Lichte, Stefan Valentin, Holger von Mal...
ECSQARU
2009
Springer
15 years 6 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...