Sciweavers

5580 search results - page 1014 / 1116
» Randomized priority algorithms
Sort
View
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
12 years 11 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
ESOP
2011
Springer
12 years 11 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
12 years 11 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
ESORICS
2009
Springer
13 years 5 months ago
Anonymity and Historical-Anonymity in Location-Based Services
The problem of protecting user's privacy in Location-Based Services (LBS) has been extensively studied recently and several defense techniques have been proposed. In this cont...
Claudio Bettini, Sergio Mascetti, Xiaoyang Sean Wa...
IACR
2011
94views more  IACR 2011»
12 years 7 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
« Prev « First page 1014 / 1116 Last » Next »