2654 search results - page 158 / 531 » On Pairing Inversion Problems |
162
click to vote
SOFSEM
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
150
click to vote
MVA
1998
15 years 7 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
121
click to vote
JSYML
2000
15 years 6 months ago
2000
It is consistent that there is a set mapping from the four-tuples of n into the finite subsets with no free subsets of size tn for some natural number tn. For any n < it is con...
162
click to vote
DISOPT
2008
15 years 6 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
157
click to vote
TCS
2008
15 years 6 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...