16404 search results - page 855 / 3281 » A set coverage problem |
217
click to vote
DCC
2001
IEEE
16 years 7 months ago
2001
IEEE
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
171
click to vote
HICSS
2009
IEEE
16 years 2 months ago
2009
IEEE
One knowledge discovery problem in the rapid response setting is the cost of learning which patterns are indicative of a threat. This typically involves a detailed follow-through,...
183
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Given a large-scale linked document collection, such as a collection of blog posts or a research literature archive, there are two fundamental problems that have generated a lot o...
219
click to vote
ATAL
2009
Springer
16 years 2 months ago
2009
Springer
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
199
click to vote
ISAAC
2009
Springer
16 years 2 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...