279 search results - page 35 / 56 » Matching Polynomials And Duality |
APLAS
2010
ACM
13 years 7 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
JCAM
2011
12 years 10 months ago
2011
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...