Sciweavers

176 search results - page 6 / 36
» Sorting and Selection with Random Costs
Sort
View
UC
2009
Springer
14 years 2 months ago
Random Number Selection in Self-assembly
Abstract. We investigate methods for exploiting nondeterminism inherent within the Tile Assembly Model in order to generate uniform random numbers. Namely, given an integer range {...
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott...
DKE
2002
107views more  DKE 2002»
13 years 7 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
COLING
2010
13 years 2 months ago
A Comparison of Models for Cost-Sensitive Active Learning
Active Learning (AL) is a selective sampling strategy which has been shown to be particularly cost-efficient by drastically reducing the amount of training data to be manually ann...
Katrin Tomanek, Udo Hahn
SAC
2004
ACM
14 years 1 months ago
A comparison of randomized and evolutionary approaches for optimizing base station site selection
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
Larry Raisanen, Roger M. Whitaker, Steve Hurley
INFOCOM
2009
IEEE
14 years 2 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...