Sciweavers

4698 search results - page 267 / 940
» Making Functionality More General
Sort
View
UAI
2008
15 years 5 months ago
Observation Subset Selection as Local Compilation of Performance Profiles
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
Yan Radovilsky, Solomon Eyal Shimony
IJCAI
2001
15 years 5 months ago
Bidding Languages for Combinatorial Auctions
Combinatorial auctions provide a valuable mechanism for the allocation of goods in settings where buyer valuations exhibit complex structure with respect to substitutabilityand co...
Craig Boutilier, Holger H. Hoos
CACM
2008
53views more  CACM 2008»
15 years 4 months ago
Distributed selection: a missing piece of data aggregation
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
Fabian Kuhn, Thomas Locher, Roger Wattenhofer
CSDA
2010
208views more  CSDA 2010»
15 years 4 months ago
Bayesian density estimation and model selection using nonparametric hierarchical mixtures
We consider mixtures of parametric densities on the positive reals with a normalized generalized gamma process (Brix, 1999) as mixing measure. This class of mixtures encompasses t...
Raffaele Argiento, Alessandra Guglielmi, Antonio P...
ENTCS
2007
109views more  ENTCS 2007»
15 years 4 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich