1040 search results - page 176 / 208 » Rounding algorithms for covering problems |
188
Voted
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
JPDC
2011
14 years 16 days ago
2011
: One important problem which may arise in designing a deployment strategy for a wireless sensor network is how to deploy a specific number of sensor nodes throughout an unknown ne...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
DGCI
2005
Springer
15 years 3 months ago
2005
Springer
A new approach to ray tracing implicit surfaces based on recursive space subdivision is presented in this paper. Interval arithmetic, already used to calculate intersections in ray...
104
click to vote
DAC
2004
ACM
15 years 1 months ago
2004
ACM
In this paper, we investigate the problem of repeater insertion for low power under a given timing budget. We propose a novel repeater insertion algorithm to compute the optimal r...