194 search results - page 33 / 39 » Computing Roundness is Easy if the Set is Almost Round |
HPDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Grid computing has been widely adopted for intensive high performance computing. Since grid resources are distributed over complex large-scale infrastructures, understanding grid ...
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, we describe a novel camera calibration method to estimate the extrinsic parameters and the focal length of a camera by using only one single image of two c...
75
Voted
AAAI
2010
14 years 11 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
SPAA
2009
ACM
15 years 4 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...