Sciweavers

160 search results - page 13 / 32
» Approximability of Manipulating Elections
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
ICASSP
2011
IEEE
13 years 1 months ago
A Bernoulli-Gaussian model for gene factor analysis
This paper investigates a Bayesian model and a Markov chain Monte Carlo (MCMC) algorithm for gene factor analysis. Each sample in the dataset is decomposed as a linear combination...
Cecile Bazot, Nicolas Dobigeon, Jean-Yves Tournere...
DISCO
1992
161views Hardware» more  DISCO 1992»
14 years 1 months ago
Combinatory Models and Symbolic Computation
We introduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of alge...
Karl Aberer
ICDE
2004
IEEE
121views Database» more  ICDE 2004»
14 years 11 months ago
Online Amnesic Approximation of Streaming Time Series
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractic...
Themistoklis Palpanas, Michail Vlachos, Eamonn J. ...
ICIP
2004
IEEE
14 years 11 months ago
Redundant image representations in security applications
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
Philippe Jost, Pierre Vandergheynst, Pascal Frossa...