Sciweavers

2031 search results - page 41 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ECCV
2006
Springer
15 years 11 months ago
Fast Memory-Efficient Generalized Belief Propagation
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
M. Pawan Kumar, Philip H. S. Torr
APPML
2007
57views more  APPML 2007»
14 years 9 months ago
On plane bipartite graphs without fixed edges
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
Khaled Salem, Sandi Klavzar
EDBT
2010
ACM
181views Database» more  EDBT 2010»
14 years 8 months ago
Private record matching using differential privacy
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
Ali Inan, Murat Kantarcioglu, Gabriel Ghinita, Eli...
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 1 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
BMCBI
2010
129views more  BMCBI 2010»
14 years 9 months ago
The LabelHash Algorithm for Substructure Matching
Background: There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseas...
Mark Moll, Drew H. Bryant, Lydia E. Kavraki