Sciweavers

1486 search results - page 120 / 298
» Algorithms for two-box covering
Sort
View
TACAS
2012
Springer
288views Algorithms» more  TACAS 2012»
13 years 11 months ago
Reduction-Based Formal Analysis of BGP Instances
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
INFOCOM
2012
IEEE
13 years 6 months ago
Strategizing surveillance for resource-constrained event monitoring
—Surveillance systems, such as sensor networks and surveillance camera networks, have been widely deployed to monitor events in many different scenarios. One common way to conser...
Xi Fang, Dejun Yang, Guoliang Xue
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 6 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
MMSEC
2004
ACM
137views Multimedia» more  MMSEC 2004»
15 years 9 months ago
Perturbed quantization steganography with wet paper codes
In this paper, we introduce a new approach to passive-warden steganography in which the sender embeds the secret message into a certain subset of the cover object without having t...
Jessica J. Fridrich, Miroslav Goljan, David Soukal
CIKM
2008
Springer
15 years 6 months ago
Multi-aspect expertise matching for review assignment
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem...
Maryam Karimzadehgan, ChengXiang Zhai, Geneva G. B...