Sciweavers

5153 search results - page 930 / 1031
» Introduction to Randomized Algorithms
Sort
View
387
Voted
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 6 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...
157
Voted
ESOP
2011
Springer
14 years 6 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»
14 years 6 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
223
Voted
EMMCVPR
2011
Springer
14 years 2 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
134
Voted
ESORICS
2009
Springer
15 years 9 days 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...