Sciweavers

15033 search results - page 2917 / 3007
» Complexity Theory and Algorithms
Sort
View
CPAIOR
2009
Springer
15 years 10 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
DCOSS
2009
Springer
15 years 10 months ago
Finding Symbolic Bug Patterns in Sensor Networks
Abstract. This paper presents a failure diagnosis algorithm for summarizing and generalizing patterns that lead to instances of anomalous behavior in sensor networks. Often multipl...
Mohammad Maifi Hasan Khan, Tarek F. Abdelzaher, Ji...
ICIAR
2009
Springer
15 years 10 months ago
Image and Video Retargetting by Darting
This paper considers the problem of altering an image by imperceptibly adding or removing pixels, for example, to fit a differently shaped frame with minimal loss of interesting ...
Matthew Brand
MFCS
2009
Springer
15 years 10 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
NOSSDAV
2009
Springer
15 years 10 months ago
Random network coding on the iPhone: fact or fiction?
In multi-hop wireless networks, random network coding represents the general design principle of transmitting random linear combinations of blocks in the same “batch” to downs...
Hassan Shojania, Baochun Li
« Prev « First page 2917 / 3007 Last » Next »