Sciweavers

492 search results - page 16 / 99
» Perfect Matching Preservers
Sort
View
PAKDD
2007
ACM
181views Data Mining» more  PAKDD 2007»
15 years 10 months ago
Practical Issues on Privacy-Preserving Health Data Mining
Privacy-preserving data mining techniques could encourage health data custodians to provide accurate information for mining by ensuring that the data mining procedures and results ...
Huidong Jin
CIKM
2008
Springer
15 years 6 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
CORR
2006
Springer
80views Education» more  CORR 2006»
15 years 4 months ago
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
Shmuel Friedland, Daniel Levy
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
15 years 4 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
CORR
2007
Springer
115views Education» more  CORR 2007»
15 years 4 months ago
FPRAS for computing a lower bound for weighted matching polynomial of graphs
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
Shmuel Friedland