562 search results - page 33 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
SIAMJO
2008
14 years 9 months ago
2008
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
SPIRE
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
80
Voted
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...