492 search results - page 39 / 99 » Perfect Matching Preservers |
130
click to vote
JCT
1998
15 years 3 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
136
click to vote
ENDM
2010
15 years 1 months ago
2010
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
138
click to vote
PVLDB
2008
15 years 3 months ago
2008
Data integration systems often provide a uniform query interface, called a mediated schema, to a multitude of data sources. To answer user queries, such systems employ a set of se...
143
Voted
DGCI
2009
Springer
15 years 7 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
136
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
Most dense stereo correspondence algorithms start by establishing discrete pixel matches and later refine these matches to sub-pixel precision. Traditional sub-pixel refinement me...