583 search results - page 55 / 117 » On small blocking sets and their linearity |
EDBT
2010
ACM
14 years 3 months ago
2010
ACM
We study the performance issue of the “iterative” record linkage (RL) problem, where match and merge operations may occur together in iterations until convergence emerges. We ...
WDAG
2009
Springer
14 years 3 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
We study the question of feature sets for robust visual object recognition, adopting linear SVM based human detection as a test case. After reviewing existing edge and gradient ba...
NIPS
2007
13 years 10 months ago
2007
Rosetta is one of the leading algorithms for protein structure prediction today. It is a Monte Carlo energy minimization method requiring many random restarts to find structures ...
CVPR
1997
IEEE
14 years 10 months ago
1997
IEEE
A framework for learning parameterized models of optical flow from image sequences is presented. A class of motions is represented by a set of orthogonal basis flow fields that ar...