Sciweavers

391 search results - page 57 / 79
» Constructive Equivalence Relations on Computable Probability...
Sort
View
89
Voted
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
15 years 6 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
97
Voted
WACV
2005
IEEE
15 years 5 months ago
Dental Biometrics: Alignment and Matching of Dental Radiographs
—Dental biometrics utilizes dental radiographs for human identification. The dental radiographs provide information about teeth, including tooth contours, relative positions of n...
Hong Chen, Anil K. Jain
EMMCVPR
2005
Springer
15 years 5 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
CVPR
2000
IEEE
15 years 3 months ago
Likelihood Functions and Confidence Bounds for Total-Least-Squares Problems
This paper addresses the derivation of likelihood functions and confidence bounds for problems involving overdetermined linear systems with noise in all measurements, often referr...
Oscar Nestares, David J. Fleet, David J. Heeger
107
Voted
IJAR
2010
91views more  IJAR 2010»
14 years 10 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens