Sciweavers

2252 search results - page 234 / 451
» Improving Random Forests
Sort
View
ICOIN
2012
Springer
14 years 2 months ago
Coordinated TCP Westwood congestion control for multiple paths over wireless networks
— Multipath TCP (MPTCP) has just been approved by the IETF. It was designed to be fairly shared with regular TCP, so its performance is equivalent that of a regular TCP flow tha...
Tuan Anh Le, Choong Seon Hong, Eui-nam Huh
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 9 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
CVPR
2012
IEEE
13 years 9 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
EUROCRYPT
2012
Springer
13 years 9 months ago
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ˜O(...
Jean-Sébastien Coron, David Naccache, Mehdi...
CVPR
2007
IEEE
16 years 8 months ago
Efficient Belief Propagation for Vision Using Linear Constraint Nodes
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
Brian Potetz