Sciweavers

2434 search results - page 103 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
189
Voted
ICCV
2011
IEEE
14 years 3 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille
121
Voted
WSC
2001
15 years 4 months ago
Efficient simulation for discrete path-dependent option pricing
In this paper we present an algorithm for simulating functions of the minimum and terminal value for a random walk with Gaussian increments. These expectations arise in connection...
James M. Calvin
114
Voted
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
16 years 20 days ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
167
Voted
BMCBI
2008
214views more  BMCBI 2008»
15 years 3 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
229
Voted
GIS
2008
ACM
16 years 4 months ago
Finding regional co-location patterns for sets of continuous variables in spatial datasets
This paper proposes a novel framework for mining regional colocation patterns with respect to sets of continuous variables in spatial datasets. The goal is to identify regions in ...
Christoph F. Eick, Jean-Philippe Nicot, Rachana Pa...