Sciweavers

2569 search results - page 293 / 514
» Approximate Objects and Approximate Theories
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
14 years 2 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 9 months ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001
PAMI
2012
13 years 9 months ago
LDAHash: Improved Matching with Smaller Descriptors
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
Christoph Strecha, Alexander A. Bronstein, Michael...
CVPR
2012
IEEE
13 years 9 months ago
Boosting algorithms for simultaneous feature extraction and selection
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Mohammad J. Saberian, Nuno Vasconcelos