Results 1  10
of
1,901
Computationally feasible VCG mechanisms
 In Proceedings of the Second ACM Conference on Electronic Commerce (EC’00
, 2000
"... A major achievement of mechanism design theory is a general method for the construction of truthful mechanisms called VCG. When applying this method to complex problems such as combinatorial auctions, a difficulty arises: VCG mechanisms are required to compute optimal outcomes and are therefore comp ..."
Abstract

Cited by 216 (6 self)
 Add to MetaCart
that essentially all reasonable approximations or heuristics for combinatorial auctions as well as a wide class of cost minimization problems yield nontruthful VCGbased mechanisms. We generalize these results for affine maximizers. The second part of this paper proposes a general method for circumventing
Coupled twoway clustering analysis of gene microarray data
 Cell Biology
, 2000
"... We present a novel coupled twoway clustering approach to gene microarray data analysis. The main idea is to identify subsets of the genes and samples, such that when one of these is used to cluster the other, stable and significant partitions emerge. The search for such subsets is a computationally ..."
Abstract

Cited by 251 (12 self)
 Add to MetaCart
computationally complex task: we present an algorithm, based on iterative clustering, which performs such a search. This analysis is especially suitable for gene microarray data, where the contributions of a variety of biological mechanisms to the gene expression levels are entangled in a large body
Minimax Entropy Principle and Its Application to Texture Modeling
, 1997
"... This article proposes a general theory and methodology, called the minimax entropy principle, for building statistical models for images (or signals) in a variety of applications. This principle consists of two parts. The first is the maximum entropy principle for feature binding (or fusion): for a ..."
Abstract

Cited by 224 (46 self)
 Add to MetaCart
statistics, we choose the set whose maximum entropy distribution has the minimum entropy. Computational and inferential issues in both parts are addressed, in particular, a feature pursuit procedure is proposed for approximately selecting the optimal set of features. The model complexity is restricted
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
that in weak reconstruction FFT can still be applied if kspace is sampled in a regular Cartesian fashion. For this reason sensitivity encoding with Cartesian sampling is particularly feasible. Moreover, the reconstruction mechanism is relatively easily understood in this case. Therefore, the first part
A multivariate technique for multiply imputing missing values using a sequence of regression models. Survey Methodology 27
, 2001
"... This article describes and evaluates a procedure for imputing missing values for a relatively complex data structure when the data are missing at random. The imputations are obtained by fitting a sequence of regression models and drawing values from the corresponding predictive distributions. The ty ..."
Abstract

Cited by 175 (8 self)
 Add to MetaCart
simulated data sets. Key Words: Item nonresponse ; Missing at random ; Multiple imputation ; Nonignorable missing mechanism; Regression ; Sampling properties and simulations.
Data fusion for visual tracking with particles
 Proc. IEEE
, 2004
"... Abstract—The effectiveness of probabilistic tracking of objects in image sequences has been revolutionized by the development of particle filtering. Whereas Kalman filters are restricted to Gaussian distributions, particle filters can propagate more general distributions, albeit only approximately. ..."
Abstract

Cited by 166 (2 self)
 Add to MetaCart
. Although this fact has been acknowledged before, it has not been fully exploited within a visual tracking context. Here we introduce generic importance sampling mechanisms for data fusion and discuss them for fusing color with either stereo sound, for teleconferencing, or with motion, for surveillance
Unsupervised joint alignment of complex images
 In ICCV
, 2007
"... Many recognition algorithms depend on careful positioning of an object into a canonical pose, so the position of features relative to a xed coordinate system can be examined. Currently, this positioning is done either manually or by training a classspecialized learning algorithm with samples of ..."
Abstract

Cited by 106 (12 self)
 Add to MetaCart
Many recognition algorithms depend on careful positioning of an object into a canonical pose, so the position of features relative to a xed coordinate system can be examined. Currently, this positioning is done either manually or by training a classspecialized learning algorithm with samples
The Complexity of Optimal Mechanism Design
, 1211
"... Myerson’s seminal work provides a computationally efficient revenueoptimal auction for selling one item to multiple bidders [17]. Generalizing this work to selling multiple items at once has been a central question in economics and algorithmic game theory, but its complexity has remained poorly und ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
rationalprobabilities. Ourresult isvery general: we show that it is hard to compute any encoding of an optimal auction of any format (direct or indirect, truthful or nontruthful) that can be implemented in expected polynomial time. In particular, under wellbelieved complexitytheoreticassumptions, revenue
The complexity of optimal mechanism design
, 2013
"... Myerson's seminal work provides a computationally efficient revenueoptimal auction for selling one item to multiple bidders. Generalizing this work to selling multiple items at once has been a central question in economics and algorithmic game theory, but its complexity has remained poorly und ..."
Abstract
 Add to MetaCart
with rational probabilities. Our result is very general: we show that it is hard to compute any encoding of an optimal auction of any format (direct or indirect, truthful or nontruthful) that can be implemented in expected polynomial time. In particular, under wellbelieved complexitytheoretic assumptions
The Computational Complexity of Truthfulness in Combinatorial Auctions
"... One of the fundamental questions of Algorithmic Mechanism Design is whether there exists an inherent clash between truthfulness and computational tractability: in particular, whether polynomialtime truthful mechanisms for combinatorial auctions are provably weaker in terms of approximation ratio th ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
than nontruthful ones. This question was very recently answered for universally truthful mechanisms for combinatorial auctions [Dobzinski 2011], and even for truthfulinexpectation mechanisms [Dughmi and Vondrák 2011a]. However, both of these results are based on informationtheoretic arguments
Results 1  10
of
1,901