14548 search results - page 2804 / 2910 » The Optimal Path-Matching Problem |
SODA
1992
ACM
15 years 1 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
ACMDIS
2010
ACM
15 years 2 days ago
2010
ACM
In this paper, we report our findings on the impact of providing users with varying degrees of control in an automated interactive scheduling system. While automated scheduling te...
SIGCOMM
2010
ACM
15 years 1 days ago
2010
ACM
Energy consumption is a major and costly problem in data centers. A large fraction of this energy goes to powering idle machines that are not doing any useful work. We identify tw...
101
click to vote
SPAA
2010
ACM
15 years 1 days ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
AEI
2007
14 years 12 months ago
2007
Data mining mechanisms have widely been applied in various businesses and manufacturing companies across many industry sectors. Sharing data or sharing mined rules has become a tr...