455 search results - page 79 / 91 » Approximation Algorithms for Partial Covering Problems |
103
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
100
click to vote
ALGORITHMICA
2011
14 years 4 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
148
click to vote
CANS
2011
Springer
13 years 9 months ago
2011
Springer
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime max...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...