1696 search results - page 41 / 340 » Permuted function matching |
119
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
STOC
1990
ACM
15 years 2 months ago
1990
ACM
We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and non...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We develop new algorithms for designing matched wavelets and matched scaling functions using a new parametrization of compactly supported orthonormal wavelets that is developed in...
SAC
2010
ACM
14 years 4 months ago
2010
ACM
The label switching problem is caused by the likelihood of a Bayesian mixture model being invariant to permutations of the labels. The permutation can change multiple times betwee...
123
click to vote
SODA
2012
ACM
13 years 13 days ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...