Sciweavers

492 search results - page 21 / 99
» Perfect Matching Preservers
Sort
View
DAM
2002
135views more  DAM 2002»
14 years 11 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
CVPR
2006
IEEE
16 years 1 months ago
Shape Representation based on Integral Kernels: Application to Image Matching and Segmentation
This paper presents a shape representation and a variational framework for the construction of diffeomorphisms that establish "meaningful" correspondences between images...
Byung-Woo Hong, Emmanuel Prados, Stefano Soatto, L...
DAM
2002
96views more  DAM 2002»
14 years 11 months ago
The structure of stable marriage with indifference
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
David Manlove
DAC
2000
ACM
15 years 4 months ago
Watermarking while preserving the critical path
In many modern designs, timing is either a key optimization goal and/or a mandatory constraint. We propose the first intellectual property protection technique using watermarking ...
Seapahn Meguerdichian, Miodrag Potkonjak
CSE
2009
IEEE
15 years 3 months ago
Adapting Privacy-Preserving Computation to the Service Provider Model
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
Florian Kerschbaum