Sciweavers

2031 search results - page 10 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
CORR
2012
Springer
193views Education» more  CORR 2012»
13 years 5 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
PRL
2008
122views more  PRL 2008»
14 years 9 months ago
Constraints for closest point finding
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
Yonghuai Liu
80
Voted
KBSE
2010
IEEE
14 years 7 months ago
Model comparison with GenericDiff
This paper proposes GenericDiff, a general framework for model comparison. The main idea is to separate the specification of domain-specific model properties and syntax from the g...
Zhenchang Xing
DOCENG
2005
ACM
14 years 11 months ago
Schema matching for transforming structured documents
Structured document content reuse is the problem of restructuring and translating data structured under a source schema into an instance of a target schema. A notion closely tied ...
Aida Boukottaya, Christine Vanoirbeek
TCS
2008
14 years 9 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki