Sciweavers

139 search results - page 13 / 28
» Approximations of upper and lower probabilities by measurabl...
Sort
View
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
CORR
2010
Springer
95views Education» more  CORR 2010»
14 years 9 months ago
Statistical Compressive Sensing of Gaussian Mixture Models
A new framework of compressive sensing (CS), namely statistical compressive sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical dist...
Guoshen Yu, Guillermo Sapiro
ICIP
2003
IEEE
15 years 11 months ago
Fast similarity search on video signatures
Video signatures are compact representations of video sequences designed for efficient similarity measurement. In this paper, we propose a feature extraction technique to support ...
Sen-Ching S. Cheung, Avideh Zakhor
FOCS
1999
IEEE
15 years 1 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
TIT
2008
90views more  TIT 2008»
14 years 9 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason