1486 search results - page 72 / 298 » Algorithms for two-box covering |
151
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
132
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
159
Voted
VMCAI
2012
Springer
13 years 11 months ago
2012
Springer
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
102
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Correlated steganography considers the case in which the cover Work is chosen to be correlated with the covert message that is to be hidden. The advantage of this is that, at leas...
121
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).