1538 search results - page 283 / 308 » Relative Randomness and Cardinality |
IBPRIA
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we argue that maximum expected utility is a suitable framework for modeling a broad range of decision problems arising in pattern recognition and related fields. Exa...
117
click to vote
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
The design of feature spaces for local image descriptors is an important research subject in computer vision due to its applicability in several problems, such as visual classifi...
127
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
RECOMB
1999
Springer
15 years 1 months ago
1999
Springer
An important goal in bioinformatics is determining the homology and function of proteins from their sequences. Pairwise sequence similarity algorithms are often employed for this ...
SIGGRAPH
1997
ACM
15 years 1 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...