Sciweavers

2695 search results - page 25 / 539
» Learning Graph Matching
Sort
View
JMLR
2010
165views more  JMLR 2010»
14 years 8 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
AAAI
2012
13 years 4 months ago
Computing the Nucleolus of Matching, Cover and Clique Games
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
Ning Chen, Pinyan Lu, Hongyang Zhang
98
Voted
AAAI
1996
15 years 3 months ago
Learning Efficient Rules by Maintaining the Explanation Structure
Many learning systems suffer from the utility problem; that is, that time after learning is greater than time before learning. Discovering how to assure that learned knowledge wil...
Jihie Kim, Paul S. Rosenbloom
111
Voted
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
15 years 7 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
ICPR
2010
IEEE
15 years 5 months ago
Cell Tracking in Video Microscopy Using Bipartite Graph Matching
Automated visual tracking of cells from video microscopy has many important biomedical applications. In this paper, we model the problem of cell tracking over pairs of video micro...
Ananda Chowdhury, Rohit Chatterjee, Mayukh Ghosh, ...