6437 search results - page 10 / 1288 » Parallel Algorithms for Arrangements |
98
Voted
IJSNET
2008
15 years 12 days ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
82
Voted
IPL
2007
15 years 9 days ago
2007
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
116
click to vote
ICANNGA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
118
Voted
CVPR
2011
IEEE
14 years 4 months ago
2011
IEEE
Modeling data by multiple low-dimensional planes is an important problem in many applications such as computer vision and pattern recognition. In the most general setting where on...
93
Voted
COMGEO
2007
ACM
15 years 12 days ago
2007
ACM
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has b...