536 search results - page 81 / 108 » The hardness and approximation algorithms for l-diversity |
COMGEO
2012
ACM
12 years 3 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
ARITH
2007
IEEE
14 years 2 months ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
ISMIR
2004
Springer
14 years 1 months ago
2004
Springer
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...