4255 search results - page 130 / 851 » Cover |
151
click to vote
CSREASAM
2006
15 years 5 months ago
2006
: The research work in this paper shows that the currently available stenographic methods might be quite easily detected by using sufficiently careful analysis of the transmitted d...
125
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
140
click to vote
APN
2010
Springer
15 years 4 months ago
2010
Springer
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
149
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
105
click to vote
COR
2006
15 years 4 months ago
2006
This paper is concerned with extending models for the maximal covering location problem in two ways. First, the usual 0