Sciweavers

6393 search results - page 1179 / 1279
» Randomized Algorithms on the Mesh
Sort
View
EMMCVPR
2011
Springer
12 years 10 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
ESORICS
2009
Springer
13 years 8 months ago
Anonymity and Historical-Anonymity in Location-Based Services
The problem of protecting user's privacy in Location-Based Services (LBS) has been extensively studied recently and several defense techniques have been proposed. In this cont...
Claudio Bettini, Sergio Mascetti, Xiaoyang Sean Wa...
IACR
2011
94views more  IACR 2011»
12 years 9 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
JMLR
2012
12 years 17 days ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...
JMLR
2012
12 years 17 days ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
« Prev « First page 1179 / 1279 Last » Next »