503 search results - page 31 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
162
Voted
PODS
2012
ACM
13 years 6 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
106
Voted
DAM
2000
15 years 3 months ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
170
click to vote
PAMI
2010
14 years 10 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
151
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
154
click to vote
JCO
2006
15 years 3 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...