Sciweavers

218 search results - page 42 / 44
» Probabilistic shadow information spaces
Sort
View
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 6 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
TALG
2010
158views more  TALG 2010»
13 years 26 days ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
AAAI
2011
12 years 6 months ago
Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation Tradeoff!
Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and ...
Paolo Viappiani, Craig Boutilier
ICCV
2007
IEEE
14 years 8 months ago
Object Localisation Using Generative Probability Model for Spatial Constellation and Local Image Features
In this paper we apply state-of-the-art approach to object detection and localisation by incorporating local descriptors and their spatial configuration into a generative probabil...
Joni-Kristian Kamarainen, Miroslav Hamouz, Josef K...
ECCV
2002
Springer
14 years 8 months ago
A Stochastic Algorithm for 3D Scene Segmentation and Reconstruction
In this paper, we present a stochastic algorithm by effective Markov chain Monte Carlo (MCMC) for segmenting and reconstructing 3D scenes. The objective is to segment a range image...
Feng Han, Zhuowen Tu, Song Chun Zhu